Which choice represents the expected upper bound for the run time of the contains(value) method of a self-balancing binary search tree? O 0(1) O O(nlogn) O O(n) O Ologn) O O(n?)

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

A set is a container that stores a collection of sorted unique elements. When we use a sorted linked structure to implement Set ADT, the time complexity of find(x), insert(x) and remove(x) are all O(n). Group of answer choices True False