1. A binary tree of height h has at least h nodes and at most ______ nodes. (a) 2h (b) 2 h (c) 2 h+1 (d) 2 h – 1 2. (True or False) A binary tree of n nodes has exactly n – 1 edges 3. Pre-order...

1. A binary tree of height h has at least h nodes and at most ______ nodes.

              (a) 2h                                              (b) 2^h

              (c) 2^h+1
(d) 2^h– 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) 2ⁿ
(b) 2n

              (c) 2ⁿ⁺¹
(d) 2^n–1