A student wrote the following inorder method (buggy). Identify the bug:public static void inorder(BinaryTreeNode node) { if (node.getLeft() != null) inorder(node.getLeft()); System.out.print(node.element + ” “); if (node.getRight() == null) inorder(node.getRight()); } What is the bug?

When deleting a node v from a Binary Search Tree that has two internal children, what is the standard procedure to maintain the BST property? 

The LinkedTree.iterator() implementation builds a snapshot via preorderSubtree(root, snapshot). Given the implementation below, what order will the iterator return elements?private void preorderSubtree(Node node, List snapshot) { if (node == null) return; snapshot.add(node.getElement()); for (Node child : node.children) preorderSubtree(child, snapshot); }

In LinkedTree.addRoot(e) the code throws IllegalStateException if root != null. Why?

Which of the following data structures guarantees O(log n) worst-case time complexity for search, insertion, and deletion? (Select all that apply)

If a sorted array contains approximately 1,000,000 elements (roughly 220), what is the maximum number of comparisons a binary search will make in a worst-case scenario?

Which statement best describes the root of a tree?

Given the BinaryTreeTraversal building expression tree for (2 * (a – 1)) + (3 * b), what does preorder(tree.root) print (space-separated)?// snippet from BinaryTreeTraversal.java Node plus = tree.addRoot(“+”); Node mult1 = tree.addLeft(plus, “*”); Node mult2 = tree.addRight(plus, “*”); tree.addLeft(mult1, “2”); Node minus = tree.addRight(mult1, “-“); tree.addLeft(minus, “a”); tree.addRight(minus, “1”); tree.addLeft(mult2, “3”); tree.addRight(mult2, “b”); // call: tree.preorder(tree.root);

What is the single most important prerequisite for performing a binary search on an array?

What is the worst-case time complexity of a sequential search on an unsorted array of N elements?