Creates a prudy display of a binary tree
Very fast run time since it uses magical math for calculating tree width.
to get the required width for printing a tree just (spacing + nodePrintLength)*(int)Math.pow(2,height-1) - 1;
The latest version of this program will also consolidate the tree, so there isn't excess white space
/--- 0 ---\
/ 1 \ / 2 \
3 4 5 6
/---0
/-1-\
/2 3
4
/------------------------------ 2 ------------------------------\
/-------------- 7 --------------\ 1
/------26 ------\ 3
90 --\ 25 --\
36 19 \
17
/----------------------------nul(13)----------------------------\
/------------nul(5) ------------\ /------------nul(8) ------------\
67(2) /----nul(3) ----\ 45(4) /----nul(4) ----\
34(1) /nul(2) \ 23(2) /nul(2) \
78(1) 89(1) 12(1) 56(1)
/------ 1 ------\
/-- 2 --\ /-- 3 --\
17 26 19 / 7 \
25 90