- Question 8 What Is The Time Complexity Of Rbt Left Rotation O O N O 0 1 O O Log N O 0 N Log N Previous 2 Pts No 1 (49.73 KiB) Viewed 30 times
Question 9 Which of the following statement is FALSE about Red-Black-Trees O All the nodes in RBT can be black O RBT can't have two adjacent RED nodes Root of the RBT is Black O RBT is a balanced BST so that operations can be done in log(n) time O Parent of a given node has to be RED < Previous 2 pts Not saved N
D Question 10 Which of the following is true about finding kth smallest element in an unsorted array? O The best running time in finding kth smallest is O(log(n)) as we can use the recursion O The best running time in finding kth smallest is O(n) O First, we can sort it and then find the kth position. That will take O(nlog(n)) time in the best case O The best running time in finding kth smallest is O(1) as we find only the kth smallest Previous 2 pts Not saved Ne