The 5 attached questions need to be completed in Java. Except question 3 which is an illustration with some text. That question also references an exercise which can be found...

Ques 1
Node class
public class Node {
public Node rightDir;
public int value;
public Node leftDir;
public Node(int value) {
this.value = value;
this.rightDir =null;
this.leftDir =null;
}
}
Class BinarySearchTree
public class BinarySearchTree {
public Node root;
public BinarySearchTree() {
this.root = null;
}
public void insertTheValue(int d) {
root = insertTheValue(root, d);
}
public void inorderPrinting() {
inorderPrinting(root);
}
private void inorderPrinting(Node node) {
if (node != null) {
inorderPrinting(node.leftDir);
System.out.print(node.value + " ");
inorderPrinting(node.rightDir);
}
}
private Node insertTheValue(Node newNode, int d) {
if (newNode == null) {
newNode = new Node(d);
} else {
if (d <= newNode.value) {
newNode.leftDir = insertTheValue(newNode.leftDir, d);
} else {
newNode.rightDir = insertTheValue(newNode.rightDir, d);
}
}
return newNode;
}
public void postorderPrinting() {
postorderPrinting(root);
}
private void postorderPrinting(Node node) {
if (node != null) {
postorderPrinting(node.leftDir);
postorderPrinting(node.rightDir);
System.out.print(node.value + " ");
}
}
public void preorderPrinting() {
preorderPrinting(root);
}
private void preorderPrinting(Node node) {
if (node != null) {
System.out.print(node.value + " ");
preorderPrinting(node.leftDir);
preorderPrinting(node.rightDir);
}
}
}
Main class
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
BinarySearchTree btree = new BinarySearchTree();
btree.insertTheValue(98);
btree.insertTheValue(45);
btree.insertTheValue(32);
btree.insertTheValue(65);
btree.insertTheValue(10);
btree.insertTheValue(3);
btree.insertTheValue(8);
btree.insertTheValue(7);
System.out.printf("==== Postorder traversal ===="+'\n');
btree.postorderPrinting();
System.out.println();
System.out.printf("===== Preorder traversal ===="+'\n');
btree.preorderPrinting();
System.out.println();
System.out.printf("==== Inorder traversal ===="+'\n');
btree.inorderPrinting();
}
}
Ques 2
Node class
public class Node {
Node leftDir, rightDir;
public int value;
public Node(int data) {
this.value = data;
this.leftDir = null;
this.rightDir = null;
}
}
BinarySearchClass
public class BinarySearchTree {
public Node root;...