Please enable JavaScript.
Coggle requires JavaScript to display documents.
BinarySearchTree (Structure (all nodes in left subtree < root, all node…
BinarySearchTree
-
How to
-
add value
- if val2add > root.val, go to right subtree
- search until empty slot is found
- attach the value to the empty slot
-
Balanced BST
AVL
for any node, depth difference between left/right subtrees is at most 1
RedBlack Tree
-
from root to any leaf, the path length is similar
-