Extreme Recursion with Binary Tree Topologies
How many binary tree topologies are possible given n nodes?
Closest Common Ancestor of a Node in a Tree
You have a tree data structure. Write an algorithm that given any two nodes in the tree, finds the node that is the closest common ancestor to them.
Given a tree, prune it to select for only a certain node color
Given that a tree is made of only red or black nodes, return another tree that only has the paths of the original tree leading to a red node.
Tree In-Order Traversal to Next Node
Given a node in a binary tree, implement the algorithm for finding its next in-order node in the containing tree.
Breadth First Tree Traversal
Write an algorithm that takes a tree data structure and writes out all the elements in a breadth-first traversal order.