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?

Which traversal is best to compute the total disk usage of a directory (sum sizes of files and subdirectories)?

What is the Height-Balance Property that defines an AVL Tree? 

Which of the following statements about sequential search are true? (Select all that apply)

If an algorithm has a time complexity of O(n log n) and you double the input size, how would you expect the running time to change?