binary trees one way to begin is by making an array of trees ( group of unconnected trees is called forest take each letter typed by the user and put it in node take each of these nodes and put it in treewhere it will be the root now put all these one-node trees in the array start by making new tree with at the root and two of the one-node trees as its children then keep adding one-node trees from the array to this larger tree don' worry if it' an unbalanced tree you can actually store this intermediate tree in the array by writing over cell whose contents have already been added to the tree the routines find()insert()and delete()which apply only to search treescan be deleted keep the displaytree(method and the traversals because they will work on any binary tree expand the program in programming project to create balanced tree one way to do this is to make sure that as many leaves as possible appear in the bottom row you can start by making three-node tree out of each pair of onenode treesmaking new node for the root this results in forest of threenode trees then combine each pair of three-node trees to make forest of seven-node trees as the number of nodes per tree growsthe number of trees shrinksuntil finally there is only one tree left againstart with the tree java program and make tree from characters typed by the user this timemake complete tree--one that is completely full except possibly on the right end of the bottom row the characters should be ordered from the top down and from left to right along each rowas if writing letter on pyramid (this arrangement does not correspond to any of the three traversals we discussed in this thusthe string abcdefghij would be arranged as one way to create this tree is from the top downrather than the bottom up as in the previous two programming projects start by creating node which will be the root of the final tree if you think of the nodes as being numbered in the same order the letters are arrangedwith at the rootthen any node numbered has left child numbered * and right child numbered * + you might use recursive routine that makes two children and then calls itself for each child the nodes don' need to be created in the same order they are arranged on the tree as in the previous programming projectsyou can jettison the search-tree routines from the tree class