Write a method construct
that could be added to the IntTree
class from lecture and section. The method accepts an array of integers as a parameter and constructs a balanced binary search tree containing those integers. The tree should be constructed so that for every node, either the left/right subtrees have the same number of nodes or the left subtree has one more node than the right.
For example, if you have an IntTree
variable called tree
and an array called data
storing values [1, 2, 3, 4, 5, 6, 7]
and a call of tree.construct(data);
, is made, tree
should store the tree below at left. If the array stores [3, 8, 19, 27, 34, 42, 49, 53, 67, 74]
, the tree below at right is constructed.
Array 
[1, 2, 3, 4, 5, 6, 7] 
[3, 8, 19, 27, 34, 42, 49, 53, 67, 74] 
Tree 
++
 4 
___ ++ ___
/ \
++ ++
 2   6 
++ ++
/ \ / \
++ ++ ++ ++
 1   3   5   7 
++ ++ ++ ++

++
 42 
_ ++ _
_ / \ _
/ \
++ ++
 19   67 
++ ++
/ \ / \
/ \ / \
++ ++ ++ ++
 8   34   53   74 
++ ++ ++ ++
/ / /
/ / /
++ ++ ++
 3   27   49 
++ ++ ++

Notice that when it is not possible to have left and right subtrees of equal size, the extra value always ends up in the left subtree, as in the overallRoot
of the second tree which has 5
nodes in the left subtree and 4
in the right.
Your method should replace any existing tree. For full credit your solution is required to run in O(N)
time where N
is the number of elements in the array. You may assume that the values in the array appear in sorted order.
You may define private helper methods to solve this problem, but otherwise you may not call any other methods of the class nor create any data structures such as arrays, lists, etc. You also may not alter the array that you are passed.
Assume that you are adding this method to the IntTree
class as defined below:
public class IntTree {
private IntTreeNode overallRoot;
...
}