Font size
WorksheetsTrees
Total questions: 10
Worksheet time: 5mins
The number of edges from the root to the node is called __________ of the node.
Height
Length
Path
Depth
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
Complete binary tree is
Each level is filled except last level
Binary tree
Each level is filled except first level
all levels are filled
last level is filled from left to right
Inorder traversal
Left Right Root
Left Root Right
Right Left Root
Right Left Root
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 2 3
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
The no of external nodes in a full binary tree with 5 internal nodes is?
(a)
Which is/are correct?
Every binary tree is either complete or full
Every full binary tree is also a complete binary tree
Every complete binary tree is also a full binary tree
All of the above
None of these
Preorder of a binary tree with the following
Postorder traversal: 1 3 5 4 2
Inorder traversal: 1 2 3 4 5
(a)
How many roots exist for a binary tree?
(a)
