Add a new value to a binary search tree so that the BST property is preserved.
Look up whether a value exists in a binary search tree.
Find how many levels deep a binary tree goes from root to its deepest leaf.
Visit every node in a binary tree in left-root-right order (gives sorted order for BSTs).
Visit every node in a binary tree in root-left-right order.
Visit every node in a binary tree level by level, from top to bottom.
Check whether a binary tree satisfies the BST rule (left < root < right) at every node.
Find the longest path between any two nodes in a binary tree, counted in edges.
Imagine looking at a binary tree from the right side. List what you'd see from top to bottom.
Count nodes where no ancestor on the path from the root has a larger value.