BST.java

Question 1

list all the methods and attribute(s) of this class

Answer 1

*attributes:
-private Node root;
*public BinarySearxhTree() //constructor
*public void addNode(int n)
*public String toString();
*private void inOrderRecursuve(Node ptr, List<Integer> list)</Integer>

Question 2

attribute for this class

Answer 2

private Node root;

Question 3

public BinarySearchTree()

Answer 3

root = null;

Question 4

private Node addNode(int n)
(create a new node and list scenarios)

Answer 4

Node temp = new Node(n);
*Scenario 1: Tree is empty = add node to root
*Scenario 2: Tree is not empty = add node by traversing the tree

Question 5

Scenario 1: Tree is empty

Answer 5

if (root == null) {
root = temp;
}

Question 6

Scenario 2

Answer 6

else {
Node ptr = root;
while(true) {
if(temp.n < ptr.n) {
if(ptr.left != null)
ptr = ptr.left;
else
ptr.left = temp;
return;
}
else if (do the same for the right)
else
return;

Question 7

public String toString()

Answer 7

List<Integer> list = new ArrayList<>;
inOrderRecursive(root,list);
return list.toString();</Integer>

Question 8

public void inOrderRecursive(Node ptr, List<Integer> list)</Integer>

Answer 8

if(ptr == null) {
return;
}
inOrderResursive(ptr.left, list);
list.add(ptr.n)
inOrderRecusrive(ptr.right, list)(