D 2. In the binary search tree above, finding node E requires one comparison and finding node A requires four comparisons. What is the expected number of comparisons required to find a node chosen at random?

TREE C: 1. Is tree Ca binary search tree? 2. If tree C is a binary search tree, is it balanced or skewed? If it is not a binary search tree, why not?

BACKTRACKING

Question in image. No need for the code. Please explain the algorithm in a simple way with the answer. Thank you

In the binary search tree, write a function that takes in a root, p, and checks whether the tree rooted in p is a binary search tree or not. What is the time complexity of your function? def is_bst(self, p: Node):

Let T be a binary search tree with n nodes, in which n > 0. When T is linear, the search algorithm makes key comparisons, in the unsuccassful case.

The minimum height of a binary search tree win n keys is log2 n. Select one:  True or False

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

In the worst-case situation, binary tree sort using a self-balancing binary search tree requires O(n log n) time, which is slower than merge sort.