Pre-order traversal is also called______. (a) Depth first (b) Breadth first (c) Level order (d) In-order
1. A binary tree of height h has at least h nodes and at most ______ nodes.
(a) 2h (b) 2h
(c) 2h+1 (d) 2h– 1
2. (True or False) A binary tree of n nodes has exactly n – 1 edges
3. Pre-order traversal is also called______.
(a) Depth first (b) Breadth first
(c) Level order (d) In-order
4. Total number of nodes at the nth level of a binary tree can be given as
(a) 2n (b) 2n
(c) 2n+1 (d) 2n–1
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
