In the binary search tree the insertion of the value 29 will be located as the right child of 28. 30 40 48 O True O False 2 Red Black and AVL Binary Search Trees have algorithms to re-balance a tree in running time of O Olog n) O 0(1) O Oin) O Oln log n) 3 Deleting an element in a balanced binary search tree has a running time of O On log n) O On) O Olog n) O 01) 4 In the above binary search treeif the value 25 k deleted, it may be rslaced wilth which of the fokowing node values? Sckect all that are corect. D 20 D 28 D 22 O 30 In the above binary search aree if the value 28 is deleted, it wil not be replaced with anather node. O Iue O Fae 6 You tind the minimum valuc in a binary scarch tree by starting at the roat and repeatedly going to the right chad unti there are no more right chaldren. You have found the minimum. O Ina O Fale