More Problems

• Find the maximum depth of a specific node in a binary search tree.
• Check if a binary tree can be converted to a binary search tree with one modification.
• Find the second smallest value in a binary search tree.
• Calculate the number of leaf nodes at each level in a binary tree.
• Implement a function to check if a binary tree is complete using a queue.
• Find the total number of unique binary trees that can be formed with N nodes.
• Count the number of paths in a binary search tree that satisfy a specific value.
• Implement a function to find the longest consecutive path in a binary search tree.