You are on page 1of 1

a) n/m to load the entire tree into memory

b) We can store all of the values on one side of the tree in adjacent pages. This would reduce it
by half, assuming the tree is balanced.

c) we can use an array-representation of a tree:

You might also like