java:

1. Draw the tree represented by the following array.

H J G E M Y S C F E

[0] [1] [2] [3] [4] [5] [6] [7] [8] [9]

2.Draw a graph (picture) of the binary tree of letters that has been implemented as an array of classes with a data item, left and right child indices as is shown below. Assume that root has index 0.

Index Value LChild RChild

[0] K 3 1

[1] Z -1 4

[2] X -1 -1

[3] J 2 -1

[4] B -1 -1

3.A full binary tree of height N has how many leaves?

.