Binary Tree

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

• Perfect Binary Tree

• Complete Binary Tree

• TreeTraversal

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.

• Perfect Binary Tree

• Binary Tree

• Tree Traversal

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

• Complete Binary Tree

• Binary Tree

• Node

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

• Pre-, Out- and Post-order

• Pro-, In- and Past-order

• Pre-, In- and Post-order

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

• Degenerate or Pathological Tree

• Depth of Node

• Edge

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

• True

• False

Is the topmost mode of a tree

• Balanced Binary Tree

• Root

• Depth of a Node

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

• Depth of a Node

• Root

• Edge

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

right nodes.

• Skewed Binary Tree

• Perfect Binary Tree

• Complete Binary Tree

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

• BINARY TREE

• BALANCED BINARY TREE

• TREE