Height of a tree is the total number of nodes on the path from the root node to the deepest …

A binary tree is a non-linear and hierarchical data structure which has zero children, one child or two children. An …

Binary tree traversals can be done by Depth-first traversal and Breadth-first traversals or Level order traversal. Preorder traversal, Inorder traversal …

Program to print reverse level order traversal of a binary tree i.e., print data in a binary tree from …

Find the maximum element in a Binary tree using recursion or iterative solution. For example, a binary tree contains the …

Search a node in a Binary tree using recursion or iterative solution. For example, a binary tree contains the following …

Find the size of a Binary tree using recursion or iterative solution. For example, a binary tree contains the following …

The rightmost node among the leaf nodes is known as the deepest node in a binary tree. Find the deepest …

Those nodes in the tree which don't have any child are known as leaf nodes i.e., A node …

Those nodes in the tree which have both the children are known as full nodes i.e., A node is …

Those nodes in the tree which have only one child are known as half nodes i.e., A node is …

Write a program to compare the structure of two binary trees without data and if they are identical then return …

Write a program to compare the structure data of two binary trees and if they are identical then return true …

Write a program to find the maximum level sum in a binary tree even if nodes may have negative values …

The diameter of a tree is the number of nodes on the longest path between two leaves in the tree …

Write a program to find all root to leaf paths of a Binary tree. A tree has different paths from …