More Problems

• Find the number of unique binary search trees that can be formed with N distinct nodes.
• Check if a binary tree is a subtree of another binary tree.
• Implement a function to find the distance between two nodes in a binary tree.
• Find the sum of all left leaves in a binary tree.
• Find the diameter of a binary tree (the longest path between any two nodes).
• Implement a function to convert a binary search tree into a sorted doubly linked list.
• Count the number of unique BSTs that can be formed using the values from 1 to N.
• Check if a binary tree is height-balanced.