The depth of a path from the start to terminal Leaf is the number of Nodes the path passes through. In a balanced binary tree, all paths have depths that differ by no more than 1.

1. Write a predicate to decide if a tree is balanced

2. Write a function that builds a balanced tree from a sequence of elements: recurse down the sequence adding elements to the tree

Use Main() method to test.

method Main() {

var what := addSeqToTree(Empty,

[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19]);

print "[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19] = ",

what.0," ";toPrint(what.1);

}

...