More Problems

• Check if a binary tree is symmetric (mirror image of itself).
• Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.
• Implement level order traversal of a binary tree.
• Convert a sorted array into a height-balanced binary search tree.
• Return the right side view of a binary tree.
• Find the maximum depth of a binary tree.
• Find the minimum depth of a binary tree.
• Check if two binary trees are the same.