Binary Tree

In Order traversal

• 40 20 50 10 30

• 40 50 20 30 10

• 10 20 30 40 50

• 50 40 20 30 10

What is a complete binary tree?

• Each node has exactly zero or two children

• A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right

What is the value of the ROOT node in this Tree?

• 35

• 24

• 42

• 20

In a full binary tree...........................

• Each level has exactly 0 or 2 nodes

• All the leaves are at the same level

• Each node has exactly zero or two children

• Each level has exactly 2 nodes

How many leaf are there in the tree?

• 1

• 3

• 4

• 7

Which of the following is a non linear data structure?

• Stack

• Queue

• Tree

• Array

Preorder Traversal of the tree

• 1 4 9 5 2 8 3

• 1 4 9 5 2 3 8

• 1 4 9 8 5 2 3

• 1 4 9 8 5 3 2

The nodes with no successor are called?

• Leaf Node

• Internal Node

• Parent Node

• Child Node

In which traversal root node comes at first position?

• Pre Order

• Post Order

• In Order

• None of the above

Post order traversal of the tree

• 9 8 4 2 3 5 1

• 4 9 8 5 2 3 1

• 8 9 4 2 3 5 1

• 8 9 4 3 2 5 1