Coding with Binary (not necessarily search) Trees

Today in class, we coded several binary tree methods. The solutions aren't included here, because the point of the exercise was for you to practice.

So, a good idea would be to actually code these up and test them -- using a real computer!

Methods

• public double sparseFactor() // Returns ratio of leaves to internal nodes
• public long balanceFactor() // Returns the difference in height between the lowest and highest leaves
• public boolean isBST() // Returns true, iff the binary tree is a BST
• public boolean isHeap() // Returns true, iff the binary tree is a Binary Heap (use Comparable for items)
• public BST clone() // Returns a new BST that has both the same items and shape as the original
• public boolean isClone(BST otherTree) // Returns true iff the otherTree has the same items and same shape as this tree
• public boolean matchingItems(BST otherTree) // Returns true iff the otherTree has the same items (but not necessarily the same shape) as this tree