Beginning with an empty binary search tree, what binary search tree is formed when you insert the following values in the order given? (Values are compared in alphabet order, e.g., A < B) (a) W, T, N, B, A, J, E (b) W, T, N, A, B, E, J (c) A, B, J, W, N, T, E

12. Find By Value Runtimes What is the worst case runtime for a "find by value" operation for linked lists and for balanced binary search trees? Pick ONE option Linked List: 0(n^2); Balanced BST: O(1) Linked List: 0(n); Balanced BST: O(log(n)) Linked List: O(n^2) ; Balanced BST: O(log(n)) Linked List: 0(n) ; Balanced BST: O(n)

= Suppose that we have a B and the size of the search key field V is equal to 10 bytes, the size of the data (record) pointer Pr 6 bytes, and the tree (block) pointer P is 5 bytes and the value of p (the order or the maximum number of a tree pointers in a node) is equal to 20 for an internal node. a) Calculate the block size (B) b) Suppose that we have a B- tree instead of B and based on the block size found in question (a), calculate the order (p) for an internal node in this case.

In a binary search tree, to remove a node N that has parent P and one child C, we do the following:   Group of answer choices If C is the right child of N, we make C the right child of P, and if C is the left child of N, we make C the left child of P   If C is the right child of N, we make C the left child of P, and if C is the left child of N, we make C the right child of P   If N is the left child of P, we make C the left child of P and if N is the right child of P, we make C the right child of P   If N is the left child of P, we make C the right child of P and if N is the right child of P, we make C the left child of P   none of the above

What type of BST traversal is corresponding to the code below? void Tree::Traverse(Node *node) { if (node == NULL) | | Traverse(node->left); return; Traverse(node->right); cout data << " "; } post-order in-order O pre-order O None of them

Draw a binary search tree by inserting the following numbers and determine the predecessor and successor of 10, 1, and 6. numbers to insert {8,1,5,4,9,10,6,3,15}

You have an empty binary search tree. After that, you do the following sequence of insertions:20, 30, 10, 50, 40, 60. Draw the status of the binary search tree after the first 3 insertions, and at the endof all 6 insertions (you only need to show 2 trees).