JAVA

Balanced BinarySearchTree Implement and test the balance method using the given pseudo-code for the BinarySearchTree. Write a driver program to test it on the following trees and verify the resulting balanced tree as shown. A post-order tree traversal will give you a quick test to make sure your method is working. Balance Iterator iter- tree.getIterator (Inorder) int index0 while(iter.hasNext()) array[index] -iter.next() index++; tree - new BinarySearchTree); tree. InsertTree(0, index-1); InsertTree(low, high) if(low -high) tree.add(array[low]) else if((low+1) -- high) tree.ad(array[low]) tree.add (array[high]) else mid (low high) / 2; tree.add (array[mid]) tree.InsertTree(low, mid-1); tree.InsertTree(mid+1, high); Tree1: 0034 0015 0015 0050 0011 0034 0012 0016 0010 0010 0012 0016 0050 0011