binary-search-trees Building a balanced BST and implementing level-order, preorder, inorder, and postorder traversals.