# CSCI 333 Homework 3

This homework is not graded. It is practice for Quiz 3.

## Problem 1

Build a binary search tree by starting with an empty tree
and then adding, in order, the eight values 25, 14, 20, 11, 99, 77, 33,
and 50.

## Problem 2

Now show the binary search tree that results from removing, in order,
the values 77 and 25 from the tree you constructed in
Problem 1.

## Problem 3

Start with an array containing the six values 13, 14, 20, 11, 99, 77, and 33
stored sequentially in this order. Now "run" the efficient
heap building procedure
described in Section 5.5 and illustrated in Figure 5.21(b)
on this array to build a minheap stored within an array.

## Problem 4

Remove the two smallest elements from the heap created in
Problem 3. Be sure to restore the heap to the proper format.

## Problem 5

Add the elements 88 and 12 to the heap created in Problem 3.
Again, be sure to restore the heap to the proper format.

## Problem 6

Using the general tree node class of Chapter 6,
write a small section of code that sets `GTNode ``MC`

to the middle child of `GTNode ``PA`

.