lp02 : Leetcode practice with binary search trees

num	ready?	description	assigned	due
lp02	true	Leetcode practice with binary search trees	Thu 04/17 09:00AM	Fri 05/30 11:59AM

Additional Practice Problems

Note: A maximum of two medium difficulty problems from this problem set will count toward the 10% overall grade for Leet Code problems. Submit direct links to your solution for at least 2 problems on the assignment on Gradescope by the due date..

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): https://leetcode.com/problems/kth-smallest-element-in-a-bst/
10. All elements in two BSTs in ascending order (medium): https://leetcode.com/problems/all-elements-in-two-binary-search-trees/description/
11. Path Sum II (medium):https://leetcode.com/problems/path-sum-ii/description/?envType=problem-list-v2&envId=binary-tree