Data Structure
文章平均质量分 84
Wolf Baby
这个作者很懒,什么都没留下…
展开
-
The last Internal Node of a Complete Binary Tree
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原创 2021-09-01 14:55:08 · 130 阅读 · 0 评论 -
Sorts
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...原创 2020-01-16 15:11:27 · 241 阅读 · 0 评论 -
Calculator (double stack)
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...原创 2019-11-17 22:15:46 · 227 阅读 · 0 评论 -
Binary Tree Traversal
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...原创 2019-10-21 16:13:32 · 161 阅读 · 0 评论 -
Haffman Coding
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...原创 2019-10-20 20:49:22 · 181 阅读 · 0 评论 -
List Summary
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.原创 2019-10-20 12:00:41 · 214 阅读 · 0 评论