- 博客(5)
- 资源 (1)
- 收藏
- 关注
RSS订阅翻译 binary tree traversal
- Preorder traversal root -> left -> right- Inorder traversal left -> root -> right- Postorder traveral left -> right -> rootorder means root node's order. examplepreorder
2017-12-17 17:26:20
153
转载 add maven dependencies to eclipse run
mvn -Declipse.workspace=d:\wks eclipse:configure-workspace
2017-12-13 13:14:16
130
翻译 AVL tree
self balancing tree, named after their inventors, Adelson-Velskii and Landis.- difference between heights of left node and right node should be less than or equal to one- the height of balanced tr
2017-12-12 15:05:46
183
翻译 Red Black Tree
self balancing search tree (BST)- every node has a color either black or red- root node is always black- no two adjacent red nodes. red node always have black children if any- the numbers of b
2017-12-11 15:43:15
132
转载 Queue
name offer peak poll comments PriorityQueue o(log(n)) o(1) o(log(n)) priority heap backed by array, reference:http://blog.csdn.net/pecywang/article/details/24024835 http://www.jianshu.
2017-12-03 17:30:34
120
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人