First lecture of march yaya
very important things ahead
27, 31, 15, 17, 4, 79, 87, 49, 3, 1 These r the numbers.
BST insert
Pseudo code time
1. We take in the root and the new node
2. if root is null, new is returned as the new root
3. if the new key == root key, that's an error (no dups)
4. If the new key > root key,
1. insert new in right subtree
5. else
1. insert new in left subtree