pa02 : Leetcode practice with binary search trees

Additional Practice Problems

Work through these additional problems on leetcode as practice for the upcoming midterm

1. Maximum Depth of Binary Search Tree (easy) - same as height of the BST (we coded this in lecture): https://leetcode.com/problems/maximum-depth-of-binary-tree/description/
2. Convert Sorted Array to Binary Search Tree (easy): https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/description/
3. Find Mode in Binary Search Tree (easy): https://leetcode.com/problems/find-mode-in-binary-search-tree/description/
4. Invert BST (easy): https://leetcode.com/problems/invert-binary-tree/description/
5. Convert BST to Greater Tree (medium): https://leetcode.com/problems/convert-bst-to-greater-tree/description/
6. Construct a BST from Preorder Traversal (medium): https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/description/
7. Lowest Common Ancestor (medium): https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/description/
8. Validate Binary Search Tree (medium): https://leetcode.com/problems/validate-binary-search-tree/
9. Kth Smallest Element in a BST (medium) - we worked through the solution in lecture 5: https://leetcode.com/problems/kth-smallest-element-in-a-bst/