Topic: Binary-tree-question / Level: Beginner

• 61. Create a function to get the mirror image of a binary tree.
• 62. Write a program to print the leaf nodes of a binary tree in a single line.
• 63. Create a function to find the longest path in a binary tree.
• 64. Write a program to determine if a binary tree is a full binary tree.
• 65. Implement a function to find the first leaf node in a binary tree.
• 66. Create a function to print the values of a binary tree in reverse level order.
• 67. Write a program to find the number of nodes that are not leaves in a binary tree.
• 68. Implement a function to print the middle node of a binary tree.
• 69. Create a function to find the sum of all nodes at odd levels in a binary tree.
• 70. Write a program to count the number of nodes with one child in a binary tree.
• 71. Create a function to print all ancestors of a given node in a BST.
• 72. Write a program to find the second largest element in a BST.
• 73. Implement a function to check if a binary tree is a proper binary tree.
• 74. Write a program to print the nodes at the last level of a binary tree.
• 75. Create a function to find the minimum depth of a binary tree.
• 76. Write a program to find the maximum value of the tree's nodes.
• 77. Implement a function to check if a binary tree is a leaf.
• 78. Create a program to find the largest value of the left child of a binary tree.
• 79. Write a function to get the height of a BST.
• 80. Create a program to perform a left-to-right level order traversal of a binary tree.
• 81. Write a program to find all the paths that sum to a given value in a binary tree.
• 82. Implement a function to create a balanced binary tree from an unsorted array.
• 83. Create a function to check if a binary tree is a proper binary search tree.
• 84. Write a program to print the post-order traversal of a binary tree without recursion.
• 85. Implement a function to find the smallest node in a BST.
• 86. Create a program to find the first node in the post-order traversal.
• 87. Write a function to count the number of nodes with two children in a binary tree.
• 88. Create a function to print all nodes that are children of a specific node.
• 89. Write a program to check if a binary tree is a complete binary tree.
• 90. Implement a function to print all ancestors of a node in a binary tree.

• More Levels

• Intermediate
• Advanced