implement the Binary Tree. That means implementing all the 6 functions and run your codes to create tree of Figure 8.9 (b) . Your program should print out the tree of Figure 8.9 (b) in JAVA

Functions:

Figure 8.9(b)

addRoot(e) : Creates a root for an empty tree, storing e as the element, and returns the position of that root; an error occurs if the tree is not empty. addLeft (p,e) : Creates a left child of position p, storing element e, and returns the position of the new node; an error occurs if p already has a left child. addRight (p,e) : Creates a right child of position p, storing element e, and returns the position of the new node; an error occurs if p already has a right child. set (p,e) : Replaces the element stored at position p with element e, and returns the previously stored element. attach(p,T1,T2) : Attaches the internal structure of trees T1 and T2 as the respective left and right subtrees of leaf position p and resets T1 and T2 to empty trees; an error condition occurs if p is not a leaf. remove (p) : Removes the node at position p, replacing it with its child (if any), and returns the element that had been stored at p; an error occurs if p has two children