could someone explain the code below (give a full explanation) how does work, ho

Question

could someone explain the code below (give a full explanation) how does work, how is it implemented, what is each function's job, what is the purpose or purposes of it, and so on.. (life safer will be given for the best explanation)

package BinarySearchTree;

public class BinarySearchTreeTest {
public static void main(String[] args) {
BinarySearchTree bst = new BinarySearchTree();
int[] input = new int[] { 8, 3, 10, 551, 6, 14, 4, 7, 13, 16, 0, 140,
3, 6 };

for (int i = 0; i < input.length; i++) {

bst.insert(new Node(input[i], null, null));
}
System.out.println("Print Tree:");
bst.printInOrder();

Integer i = new Integer(8);
Node n = bst.find(i, bst.getRoot());
System.out.println("Key " + n.getKey());
}
}

Explanation / Answer

package BinarySearchTree; public class BinarySearchTreeTest { public static void main(String[] args) { //generating new BST BinarySearchTree bst = new BinarySearchTree(); //declaring input array ia explicit listing int[] input = new int[] { 8, 3, 10, 551, 6, 14, 4, 7, 13, 16, 0, 140, 3, 6 }; for (int i = 0; i

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.