1. A full binary tree is a tree whose leaves are all at the same level, and every node that is not a leaf has exactly two nodes under it is a full binary tree with three levels. * (a) Draw the full...

1. A full binary tree is a tree whose leaves are all at the same level, and every node that is not a leaf has exactly two nodes under it
is a full binary tree with three levels.
*

(a)
Draw the full binary tree with four levels.
*(b)
How many nodes total are in a full binary

tree with five levels?
(c)
With six levels?
(d)
With
n
levels in general?

2.
True or false?
(a)
Main memory is volatile.
(b)
Main memory is accessed sequentially.
(c)

Disk memory is volatile.
(d)
Disk memory is accessed sequentially.
(e)
Main memory has

greater storage capacity than disk memory.
(f)
Main memory has faster access time than disk

memory.