What are the preorder and postorder traversals of the following binary tree? a 9.

Write code to traverse a binary tree in preorder and postorder. You may use my tree code as a starting point. The tree should contain at least eight nodes. You may hardcode the initialization into your program like I showed in class. Set up your tree in the program by calling setTree(---) like I did in my code. After calling your two traversals, call my inorder Traverse() method to verify that your methods print (effectively!) the same tree. I changed the inOrder Traverse () method to be private, as I mentioned in class. Note: When demonstrating the program, first turn in a hand-drawn picture of your tree. Data fields are: Title of book

Help with Java Code With following Binary Node and Binary Tree class need help making an AVL Tree with the Insert and Remove Functions that deals with the rotations. Use inheritance from Binary Tree to create AVL Tree. Modifications to the Binary Node or Binary Tree are fine. Trees should be specific for strings  Binary Node Class: public class BinNode{private String data;private BinNode left;private BinNode right;public BinNode(){data = "";left = null;right = null;}public BinNode(String d){data = d;left = null;right = null;}public void setData(String d){this.data = d;}public String getData(){return this.data;}public void setLeft(BinNode l){this.left = l;}public BinNode getLeft(){return this.left;}public void setRight(BinNode r){this.right = r;}public BinNode getRight(){return this.right;}}     Binary Tree Code: public class BinaryTree{private BinNode root;private BinNode curr;/* Function to traverse right */public void goRight() {this.curr = this.curr.getRight();}public…

To determine the earliest common ancestor of two nodes in a binary tree, devise a method and build the necessary code. Do not add more nodes to a data structure. NOTE: A binary search tree is not required in this case.