Do the following problems on Binary Trees on Practice-It:
BJP5 Self-Check 17.3: binaryTreeProperties
BJP5 Self-Check 17.4: traversal1
BJP5 Self-Check 17.5: traversal2
BJP5 Self-Check 17.6: traversal3
BJP5 Self-Check 17.11: size
BJP5 Self-Check 17.17: bstAdd1
BJP5 Exercise 17.1: countLeftNodes
BJP5 Exercise 17.2: countEmpty
BJP5 Exercise 17.3: depthSum
BJP5 Exercise 17.4: countEvenBranches
BJP5 Exercise 17.5: printLevel
BJP5 Exercise 17.6: printLeaves
BJP5 Exercise 17.7: isFull
Do the following problems in LeetCode:
Find Mode (Easy)
Search a BST (Easy)
Construct a BST from Preorder Traversal (Medium)