Algorithm

Question 29 Not yet answered What is the time complexity to remove the maximum element from Max- heap (Make your bounds as tight as possible)? Marked out of 1.00 Select one question O(n) Ol 1) O(logn) onlogn Which of the following is not correct when inserting a new node into a red- black tree? Question 30 Natyet answered Marked out of 100 P Fing Question Select one If the new entry is not the root, then starts as red If the new entry is the root, then starts as red If the parent of the new entry is black, the insertion is done All of the mentioned