Topic: tree-problem / Level: intermediate

• 1101. Find the maximum leaf-to-root path sum in a binary search tree.
• 1102. Check if a binary search tree is valid based on properties.
• 1103. Find the sum of all internal nodes at even levels in a binary tree.
• 1104. Count the number of paths from the root to leaves in a binary tree.
• 1105. Find the second largest value in a binary tree.
• 1106. Determine if a binary tree can be folded along its center.
• 1107. Check if a binary search tree is balanced by comparing heights.
• 1108. Find the depth of a specific node in a binary search tree.
• 1109. Count the number of complete nodes in a binary search tree.
• 1110. Check if a binary tree is a complete binary tree using level order.
• 1111. Find the total number of internal nodes in a binary search tree.
• 1112. Find the maximum path length from root to leaf in a binary tree.
• 1113. Count the number of leaf nodes in a binary search tree at a specific depth.
• 1114. Implement a function to calculate the maximum depth of a binary search tree.
• 1115. Find the sum of all odd nodes at even levels in a binary search tree.
• 1116. Find the longest consecutive sequence in a binary search tree.
• 1117. Check if a binary tree is a valid binary search tree by checking properties.
• 1118. Find the number of unique paths in a binary search tree that sum to a specific value.
• 1119. Check if two binary trees are mirror images of each other.
• 1120. Find all unique paths in a binary tree.
• 1121. Check if a binary search tree is a path sum tree based on properties.
• 1122. Find the height of the left and right subtrees in a binary tree.
• 1123. Count the number of paths in a binary tree that have a specific sum.
• 1124. Find the minimum value in a binary search tree.
• 1125. Count the number of leaves at each level in a binary search tree.
• 1126. Find the maximum sum of nodes in a binary tree on any path.
• 1127. Check if two binary trees are equal based on properties.
• 1128. Find the first unique node in a binary tree.
• 1129. Calculate the depth of a node in a binary search tree using properties.
• 1130. Count the total number of leaf nodes in a binary tree.
• 1131. Implement a function to check if a binary tree is a proper binary tree.
• 1132. Find the diameter of a binary search tree.
• 1133. Find the maximum width of a binary search tree.
• 1134. Count the number of leaf nodes at even depths in a binary search tree.
• 1135. Check if a binary tree can be represented as a balanced tree.
• 1136. Count the number of nodes with two children in a binary tree.
• 1137. Find the total number of nodes in a binary search tree.
• 1138. Find the sum of all nodes in a binary tree using an iterative approach.
• 1139. Check if a binary tree is a valid max heap based on properties.
• 1140. Count the number of nodes in a binary tree that are less than a given value.
• 1141. Find the maximum sum of nodes at odd levels in a binary search tree.
• 1142. Find the maximum sum of nodes at even levels in a binary search tree.
• 1143. Implement a function to print all paths from the root to leaf nodes in a binary search tree.
• 1144. Count the total number of internal nodes at a specific depth in a binary search tree.
• 1145. Find the maximum value in a binary search tree that is less than a given value.
• 1146. Find the height of the right subtree of a binary tree.
• 1147. Check if a binary tree is a path sum tree based on node values.
• 1148. Find the leftmost leaf node in a binary search tree.
• 1149. Count the number of leaf nodes that have one child in a binary search tree.
• 1150. Find the longest path in a binary search tree from any node to any leaf.

• More Levels

• Beginner
• Advanced