[Notes] Binary Search Tree / AVL Trees
Binary Search TreeProperties:> Binary Tree>key[leftSubtree(x)] ≤ key[x] ≤ key[rightSubtree(x)]Traverse:> Inorder: left, root, right;(Keys are printed in sorted order)> Preorder: root, left, right > Postorder: left, right, root... ...
原创
2022-05-05 05:33:39 ·
204 阅读 ·
0 评论