hi,

Can anybody help me with these problems...

The Binary Search Tree ADT is extended to include a bool ean method si mi - l a r Tr e e s that receives references to two binary trees and determines whether the shapes of the trees are the same. (The nodes do not have to contain the same values, but each node must have the same number of children.)

Write the declaration of the s i mi l a r Tr e e s method. Include adequate comments.

Write the body of the si mi l ar Tr ees method.

Show how treeB would look after the removal of 29, 59, and 47.

Draw the binary search tree whose elements are inserted in the following order: 50 72 96 94 107 26 12 11 9 2 10 25 51 16 17 95

Draw the binary search tree whose elements are inserted in the following order: 50 72 96 50 107 26 50 72 9 2 10 2 50 107 17 95

A complete binary tree is stored in an array called t r e e Node s , which is indexed from 0 to 99, as described in Section 8.9. The tree contains 85 elements. Mark each of the following statements as true or false, and explain your answers.

treeNodes[42] isaleafnode.

treeNodes[41] hasonlyonechild.

TherightchildoftreeNodes[12] istreeNodes[25].

ThesubtreerootedattreeNodes[7] isafullbinarytreewithfourlevels.

The tree has seven levels that are full, and one additional level that contains some elements.

47 69 49 59 29 62 23 30 61 64 405