This binary search tree underlies a TreeMap (keys only shown). How does the tree change when we call put(80, x)? 40 30 90 95 10 O no change 20 50 new node 80 as left child of 80 new node 80 as right child of 80 O new node 80 as right child of 60 new node 80 as left child of 95 new node 80 as right child of 30 O put 80 where 70 is and make 70 the right child of 60 70 60 80 99

You have the following Binary Search Tree. After the insertion of 12, 24, 81, what will be the elements in the leaf node?*           11, 32, 50, 72, 99       12, 24, 32, 50, 81, 99       11, 12, 24, 81, 32, 50, 72, 99       12, 24, 81       12, 20, 24, 32, 50, 72, 99

How many comparisons are needed to find that 22 is not in the tree? 12 28 2 4 3 1

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

build a binary search tree from the following numbers ( 1, 20, 14, 18, 7, 4, 9, 3, 5, 8, 25) then show the tree after deleting 8. Basic insertion and deletion, not self-balancing

How many children is each node allowed to have in a binary search tree?  Answer all that apply.  I know one of the answers is 2 but there is at least another one.     3     1     0     2

Consider the following binary search tree (BST). root 15 42 20 34 72 2 10 18 25 31 39 59 86 17 19 32 After executing add(6), on this tree, consider the parent node of the node that contains 6. What is the value of this parent node? 30

Given an m-by-n chocolate bar, you need to break it into mn 1-by-1 pieces. You can break a bar only in a straight line, and only one bar can be broken at a time. Design an algorithm that solves the problem with the minimum number of bar breaks. What is this minimum number? Breaking the chocolate bar can be represented by a binary tree.