Topic: tree-problem / Level: beginner

• 151. Write a program to find the number of complete subtrees in a binary search tree.
• 152. Implement a function to check if a binary search tree is a valid binary search tree using properties.
• 153. Write a program to find the number of nodes in a binary tree.
• 154. Implement a function to check if two binary trees are mirror images of each other.
• 155. Write a program to find the number of nodes in a complete binary search tree.
• 156. Implement a function to find the maximum leaf-to-root path sum in a binary search tree.
• 157. Write a program to check if a binary tree is a path sum tree.
• 158. Implement a function to count the number of leaf nodes in a binary search tree.
• 159. Write a program to print the boundary of a binary search tree.
• 160. Implement a function to find the maximum depth of a binary tree.
• 161. Write a program to find the maximum sum of any leaf-to-leaf path in a binary search tree.
• 162. Implement a function to find the total number of internal nodes in a binary tree.
• 163. Write a program to count the number of paths in a binary search tree that sum to a specific value.
• 164. Implement a function to find the maximum width of a binary tree.
• 165. Write a program to check if a binary tree is symmetric.
• 166. Implement a function to find the sum of all nodes at even depths in a binary search tree.
• 167. Write a program to find the sum of all nodes at odd depths in a binary search tree.
• 168. Implement a function to find all unique paths in a binary search tree.
• 169. Write a program to count the number of complete nodes in a binary search tree.
• 170. Implement a function to find the longest path in a binary tree.
• 171. Write a program to check if two binary trees are structurally identical.
• 172. Implement a function to count the number of nodes at a given level in a binary tree.
• 173. Write a program to find the maximum value of nodes at a given level in a binary search tree.
• 174. Implement a function to find the first leaf node in a binary search tree.
• 175. Write a program to find all non-leaf nodes in a binary search tree.
• 176. Implement a function to find the second largest node in a binary search tree.
• 177. Write a program to find the first node in a binary search tree that has a specific value.
• 178. Implement a function to find the maximum depth of a binary search tree.
• 179. Write a program to find the in-order traversal of a binary search tree iteratively.
• 180. Implement a function to find the sum of all internal nodes in a binary search tree.
• 181. Write a program to find the total number of leaves in a binary search tree.
• 182. Implement a function to count the number of odd nodes in a binary search tree.
• 183. Write a program to find the number of complete subtrees in a binary search tree.
• 184. Implement a function to check if a binary search tree is a valid binary search tree based on properties.
• 185. Write a program to find the number of nodes in a binary tree.
• 186. Implement a function to check if two binary trees are mirror images of each other.
• 187. Write a program to find the number of nodes in a complete binary search tree.
• 188. Implement a function to find the maximum leaf-to-root path sum in a binary search tree.
• 189. Write a program to check if a binary tree is a path sum tree.
• 190. Implement a function to count the number of leaf nodes in a binary search tree.
• 191. Write a program to print the boundary of a binary search tree.
• 192. Implement a function to find the maximum depth of a binary tree.
• 193. Write a program to find the maximum sum of any leaf-to-leaf path in a binary search tree.
• 194. Implement a function to find the total number of internal nodes in a binary tree.
• 195. Write a program to count the number of paths in a binary search tree that sum to a specific value.
• 196. Implement a function to find the maximum width of a binary tree.
• 197. Write a program to check if a binary tree is symmetric.
• 198. Implement a function to find the sum of all nodes at even depths in a binary search tree.
• 199. Write a program to find the sum of all nodes at odd depths in a binary search tree.
• 200. Implement a function to find all unique paths in a binary search tree.

• More Levels

• Intermediate
• Advanced