Binary Tree

In order to perform any operation on a tree, you need to reach to the specific node.

Is a type of Binary tree in which every internal node has exactly two child nodes and all the leaf

nodes are at the same level.

Is just like a full binary tree, but with two major differences

What are the 3 depth traversals for a tree data structure?

It is a the tree having a single child either left or right

In postorder traversal of binary tree right subtree is traversed before visiting root.

Is the topmost mode of a tree

It is the number of edges from the root to the node.

Is a pathological/degenerate tree in which the tree is either dominated by the left nodes on the

right nodes.

IT IS A TYPE OF BINARY TREE IN WHICH THE DIFFERENCE BETWEEN THE HEIGHT OF THE LEFT AND

RIGHT SUB-TREE FOR EACH NODE IS EITHER 0 OR 1