Binary Trees & Traversals
Traversals
- Inorder: left, root, right — gives sorted order in a BST
- Preorder: root, left, right
- Postorder: left, right, root
BST
- BST property: left subtree < node < right subtree
- Balanced BST search: O(log n)
Data Structures