yaoo_o的博客

This problem derives from Heap Sort.When you start to build the heap, you should start with the last internal node of the tree. And the index is usually N2−1\frac{N}{2} - 12N​−1, N is the total length of the array.But why is that ?Complete Binary Tre

See this ariticle on my own blog https://dyingdown.github.io/2020/01/16/Sorts/Here are some sorting ways and I use many data to test and compare. Just to illustrate the property of each algorithm.I...

See the original ariticle https://dyingdown.github.io/2019/11/12/Calculator/The pre-knowledges you should know is priority of operator. Priority is the rule that determines when we meet two operators...

See the article on my own blog https://dyingdown.github.io/2019/10/21/Binary-Tree-Traverse/.There are mainly three ways of binary tree traversal. In-order, Preorder and Post-order.For example we hav...

See the ariticle on my own blog https://dyingdown.github.io/2019/10/20/Haffman-Code/.Assume that we have a bunch of points, each point has a number means the occurrence times of the point.If we wan...

See this article on my own blog https://dyingdown.github.io/2019/10/20/List-Summary/.I’ve been studying Data Structure for a while and now I sum up some knowledges.