Find the deepest node in a binary tree that is an ancestor of both given nodes.
Find the longest path between any two nodes in a binary tree, measured in edges.
Convert a binary tree to a string so it can be saved, then rebuild the tree from that string.
Check if any path from the root to a leaf adds up to a given target number.
Look at a binary tree from the right side and list the nodes you can see at each level.
Check whether the left and right halves of a binary tree are mirror images of each other.