Topic: tree-problem / Level: intermediate

• 1051. Check if a binary tree can be folded.
• 1052. Find the maximum sum of nodes on a path in a binary tree.
• 1053. Calculate the total number of nodes in a binary search tree.
• 1054. Check if a binary tree is a binary search tree using in-order traversal.
• 1055. Implement a function to print all paths from the root to leaves in a binary search tree.
• 1056. Find the minimum path sum in a binary tree.
• 1057. Find the maximum leaf node in a binary search tree.
• 1058. Count the number of odd nodes in a binary search tree.
• 1059. Count the number of even nodes in a binary search tree.
• 1060. Find the deepest node in a binary tree.
• 1061. Calculate the sum of all nodes at a specific depth in a binary tree.
• 1062. Find the total number of internal nodes in a binary search tree.
• 1063. Check if a binary tree is a valid max heap.
• 1064. Find the maximum depth of a specific subtree in a binary tree.
• 1065. Find all nodes at distance k from a given node in a binary tree.
• 1066. Find the first leaf node in a binary tree.
• 1067. Check if two binary trees are isomorphic.
• 1068. Find the sum of all leaf nodes in a binary search tree.
• 1069. Find the path from root to the lowest common ancestor of two nodes.
• 1070. Count the number of complete binary trees with a given number of nodes.
• 1071. Check if a binary search tree is balanced based on height.
• 1072. Find the path length between two nodes in a binary search tree.
• 1073. Find the height of a binary search tree using an iterative approach.
• 1074. Determine if a binary tree has a root-to-leaf path with a specified sum.
• 1075. Implement a function to perform Morris traversal of a binary tree.
• 1076. Find the maximum product of a split in a binary tree.
• 1077. Implement a function to check if a binary tree is a subtree of another binary tree.
• 1078. Count the number of leaf nodes at each level in a binary tree.
• 1079. Find the maximum sum of nodes in a binary search tree on a path.
• 1080. Check if a binary tree is symmetric using a recursive approach.
• 1081. Find the total number of paths in a binary search tree that equal a specific sum.
• 1082. Check if a binary tree is a valid binary search tree based on properties.
• 1083. Count the number of unique paths in a binary search tree.
• 1084. Find the largest leaf node in a binary tree.
• 1085. Calculate the sum of all odd nodes in a binary search tree.
• 1086. Count the number of nodes with only one child in a binary tree.
• 1087. Find the maximum depth of a specific node in a binary search tree.
• 1088. Find all ancestors of a node in a binary search tree using recursion.
• 1089. Check if a binary tree is a path length tree.
• 1090. Find the deepest right leaf node in a binary search tree.
• 1091. Find the number of complete nodes in a binary search tree.
• 1092. Count the number of nodes in a binary tree that are greater than a given value.
• 1093. Find the maximum value of nodes at a specific depth in a binary search tree.
• 1094. Check if a binary tree is balanced using height comparison.
• 1095. Find all nodes in a binary tree with the maximum value.
• 1096. Find the total number of nodes at even depths in a binary tree.
• 1097. Count the number of nodes in a binary tree that are less than a given value.
• 1098. Find the longest path in a binary tree from any node to any leaf.
• 1099. Check if two binary trees are equivalent based on properties.
• 1100. Find the total number of leaves in a binary search tree.

• More Levels

• Beginner
• Advanced