Day 30: BST Depth-First Search

Today I continued solving leetcode problem based on BST insertion and removal. Moreover, I learned about depth-first search in binary search trees. Then, worked on solving leetcode problems to hammer home my understanding. Regarding DFS, there are three methods of traversal: inorder, preorder, and postorder.