Topic: tree-problem / Level: beginner

• 51. Write a program to find the largest element in a binary tree.
• 52. Implement a function to count the number of nodes at each level of a binary tree.
• 53. Write a program to flatten a binary tree to a linked list.
• 54. Implement a function to find the maximum width of a binary tree.
• 55. Write a program to perform Morris traversal of a binary tree.
• 56. Implement a function to calculate the sum of all nodes at odd levels in a binary tree.
• 57. Write a program to find the longest consecutive sequence in a binary tree.
• 58. Implement a function to find all duplicate subtrees in a binary tree.
• 59. Write a program to check if a binary tree is a leaf node.
• 60. Implement a function to count the number of complete subtrees in a binary tree.
• 61. Write a program to find the minimum depth of a binary tree.
• 62. Implement a function to find the maximum depth of a binary tree.
• 63. Write a program to find all nodes with the maximum value in a binary tree.
• 64. Implement a function to check if a binary tree is a path sum tree.
• 65. Write a program to find the total number of nodes in a binary tree.
• 66. Implement a function to check if a binary tree is balanced based on node heights.
• 67. Write a program to print the post-order traversal of a binary tree iteratively.
• 68. Implement a function to find the first common ancestor of two nodes in a binary tree.
• 69. Write a program to check if two binary trees are mirror images of each other.
• 70. Implement a function to count the number of odd nodes in a binary tree.
• 71. Write a program to count the number of even nodes in a binary tree.
• 72. Implement a function to find the sum of all the even nodes in a binary tree.
• 73. Write a program to find the sum of all the odd nodes in a binary tree.
• 74. Implement a function to check if a binary tree is a mirror of itself.
• 75. Write a program to find the sum of all nodes at even levels in a binary tree.
• 76. Implement a function to find the sum of all nodes at odd levels in a binary tree.
• 77. Write a program to find all paths in a binary tree that sum to a given value.
• 78. Implement a function to check if a binary tree is a perfect binary tree.
• 79. Write a program to find the longest leaf-to-leaf path in a binary tree.
• 80. Implement a function to calculate the total number of leaves in a binary tree.
• 81. Write a program to check if a binary tree is a valid binary search tree based on properties.
• 82. Implement a function to count the number of paths that sum to a target value.
• 83. Write a program to check if the path sum of a binary tree equals a target value.
• 84. Implement a function to find the minimum leaf to root path sum in a binary tree.
• 85. Write a program to find the maximum leaf to root path sum in a binary tree.
• 86. Implement a function to find the largest number in a specific level of a binary tree.
• 87. Write a program to check if a binary tree is a path length tree.
• 88. Implement a function to count the number of unique values in a binary tree.
• 89. Write a program to find the maximum number of children for any node in a binary tree.
• 90. Implement a function to find the median value in a binary search tree.
• 91. Write a program to check if a binary tree is a binary tree based on properties.
• 92. Implement a function to find the node with the minimum depth in a binary tree.
• 93. Write a program to find the level of a node based on its value in a binary tree.
• 94. Implement a function to find the number of paths that start from the root and have a sum equal to a target.
• 95. Write a program to find the number of nodes in a full binary tree.
• 96. Implement a function to find the first leaf node in a binary tree.
• 97. Write a program to find all non-leaf nodes in a binary tree.
• 98. Implement a function to check if a binary tree is a binary search tree using in-order traversal.
• 99. Write a program to count the number of non-leaf nodes in a binary tree.
• 100. Implement a function to find the depth of a specific node in a binary tree.

• More Levels

• Intermediate
• Advanced