Tree Drawing:   8. Insert the integers 1 through 7  for a red-black tree showing each step and rotation. Be sure to indicate the color of each node.

#5

In Java for the RedBlackTree how would you make the InsertFixup and RemoveFixup with the following RedBlackTree and BInNode class...   public class BinNode{private String data;private BinNode left;private BinNode right;private int height; //height field as with AVL tree or Red Black Treeprivate boolean color; //Needed for Red Black Treepublic BinNode(){data = "";left = null;right = null;}public int getHeight() {return height;}public void setHeight(int height) {this.height = height;}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;}}   public class RedBlackTree {private BinNode root;private BinNode nil;public RedBlackTree() {nil = new BinNode();nil.setColor(false); // Black color for NIL nodesroot = nil;}public…

Insert: 73, 35, 68, 94, 26, 29, 16, 44, 38, 81, 59, 61 draw 2-3-4 tree showing each value inserted using the following insertion sequence: