Topic: tree-problem / Level: intermediate

• 1001. Find the lowest common ancestor (LCA) of two nodes in a binary tree.
• 1002. Check if a binary tree is symmetric (mirror image of itself).
• 1003. 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.
• 1004. Implement level order traversal of a binary tree.
• 1005. Convert a sorted array into a height-balanced binary search tree.
• 1006. Return the right side view of a binary tree.
• 1007. Find the maximum depth of a binary tree.
• 1008. Find the minimum depth of a binary tree.
• 1009. Check if two binary trees are the same.
• 1010. Find the diameter of a binary tree.
• 1011. Validate if a binary tree is a valid binary search tree.
• 1012. Find the kth smallest element in a binary search tree.
• 1013. Find the kth largest element in a binary search tree.
• 1014. Find all leaf nodes of a binary tree.
• 1015. Determine if a binary tree is a perfect binary tree.
• 1016. Find all root-to-leaf paths in a binary tree.
• 1017. Find the maximum path sum in a binary tree.
• 1018. Convert a binary tree into its mirror image.
• 1019. Find the distance between two nodes in a binary tree.
• 1020. Find the sum of all even-level nodes in a binary tree.
• 1021. Find the sum of all odd-level nodes in a binary tree.
• 1022. Count the number of subtrees in a binary tree.
• 1023. Find the height of a binary search tree.
• 1024. Calculate the total number of leaves in a binary search tree.
• 1025. Find the left view of a binary tree.
• 1026. Find the right view of a binary tree.
• 1027. Check if two binary trees are mirror images of each other.
• 1028. Find the path with the maximum sum in a binary search tree.
• 1029. Find the first common ancestor of two nodes in a binary tree.
• 1030. Print all ancestors of a node in a binary tree.
• 1031. Check if a binary search tree is balanced.
• 1032. Find the path length between two nodes in a binary tree.
• 1033. Find the sum of all nodes in a binary tree using recursion.
• 1034. Find the second largest element in a binary search tree.
• 1035. Find the maximum leaf-to-leaf path sum in a binary tree.
• 1036. Implement a function to serialize and deserialize a binary tree.
• 1037. Find the minimum value node in a binary search tree.
• 1038. Find the maximum value node in a binary search tree.
• 1039. Count the number of internal nodes in a binary search tree.
• 1040. Find the in-order predecessor of a node in a binary search tree.
• 1041. Find the in-order successor of a node in a binary search tree.
• 1042. Check if a binary tree is balanced by comparing heights.
• 1043. Find the second minimum value in a binary tree.
• 1044. Check if a binary tree is a complete binary tree.
• 1045. Find the maximum width of a binary tree.
• 1046. Count the number of nodes at a specific level in a binary tree.
• 1047. Find the path from root to leaf with the maximum product in a binary tree.
• 1048. Find the longest consecutive sequence in a binary tree.
• 1049. Find all duplicate subtrees in a binary tree.
• 1050. Determine the level of a node in a binary tree.

• More Levels

• Beginner
• Advanced