Topic: tree-problem / Level: beginner

• 101. Write a program to check if a binary tree is a valid binary search tree by using in-order traversal.
• 102. Implement a function to find the height of a binary search tree.
• 103. Write a program to find the number of nodes in a complete binary tree.
• 104. Implement a function to print the level order traversal of a binary tree using a queue.
• 105. Write a program to check if a binary tree is a full binary tree.
• 106. Implement a function to count the total number of nodes in a binary tree.
• 107. Write a program to print all the nodes in a binary tree at a given depth.
• 108. Implement a function to find the maximum value in a binary tree.
• 109. Write a program to check if two binary trees are identical.
• 110. Implement a function to find the sum of all nodes in a binary search tree.
• 111. Write a program to find the minimum depth of a binary search tree.
• 112. Implement a function to check if a binary tree is balanced based on height.
• 113. Write a program to print the ancestors of a specific node in a binary tree.
• 114. Implement a function to count the number of leaf nodes in a binary search tree.
• 115. Write a program to find the lowest common ancestor of two nodes in a binary search tree.
• 116. Implement a function to find all the leaves in a binary search tree.
• 117. Write a program to print the post-order traversal of a binary tree using recursion.
• 118. Implement a function to find the in-order successor of a node in a binary search tree.
• 119. Write a program to check if a binary search tree contains a specific value.
• 120. Implement a function to calculate the sum of all even nodes in a binary search tree.
• 121. Write a program to calculate the sum of all odd nodes in a binary search tree.
• 122. Implement a function to find the leftmost leaf node in a binary tree.
• 123. Write a program to find the rightmost leaf node in a binary tree.
• 124. Implement a function to check if a binary tree is a proper binary tree.
• 125. Write a program to find the diameter of a binary search tree.
• 126. Implement a function to find the height of the left and right subtrees.
• 127. Write a program to check if a binary tree is complete by checking the properties.
• 128. Implement a function to find the sum of all nodes at even levels in a binary search tree.
• 129. Write a program to find the sum of all nodes at odd levels in a binary search tree.
• 130. Implement a function to check if a binary tree has a specific path sum.
• 131. Write a program to print all root-to-leaf paths in a binary search tree.
• 132. Implement a function to check if a binary search tree is balanced.
• 133. Write a program to find the total number of nodes in a full binary search tree.
• 134. Implement a function to find the node with the maximum value in a binary tree.
• 135. Write a program to check if a binary tree is a path length tree.
• 136. Implement a function to check if a binary tree has a specific depth.
• 137. Write a program to find the total number of complete nodes in a binary search tree.
• 138. Implement a function to find all paths in a binary search tree that sum to a target value.
• 139. Write a program to count the number of internal nodes in a binary search tree.
• 140. Implement a function to find the maximum value of the left child in a binary tree.
• 141. Write a program to check if a binary search tree is a binary search tree based on properties.
• 142. Implement a function to find the first leaf node in a binary search tree.
• 143. Write a program to find all non-leaf nodes in a binary search tree.
• 144. Implement a function to find the second largest node in a binary search tree.
• 145. Write a program to find the first node in a binary search tree that has a specific value.
• 146. Implement a function to find the maximum depth of a binary search tree.
• 147. Write a program to find the in-order traversal of a binary search tree iteratively.
• 148. Implement a function to find the sum of all internal nodes in a binary tree.
• 149. Write a program to find the total number of leaves in a binary search tree.
• 150. Implement a function to count the number of odd nodes in a binary search tree.

• More Levels

• Intermediate
• Advanced