Trees and Graphs Algorithms

Tree problems from easy to hard, in Python, Java or C: depth, mirror images, binary search trees, levels and paths. Every challenge comes in all three, and you can switch language on any of them.

• Maximum Depth of a Tree
• Are Two Trees the Same
• Mirror a Tree
• Root-to-Leaf Path Sum
• Values Level by Level
• Lowest Common Ancestor in a Binary Search Tree
• k-th Smallest Value in a Binary Search Tree
• Is It a Binary Search Tree
• Is There a Path
• Count the Islands
• Fill a Region
• Groups of Friends
• Fewest Steps Through a Maze
• Minutes Until Every Fruit Rots
• An Order for the Courses
• How Long Until the Signal Reaches Everyone