Which Of These Constraints Must Be Satisfied In A Heap A For Depth D It Must Contain No More Than 2 D Nodes B All L 1 (12.72 KiB) Viewed 7 times
Which Of These Constraints Must Be Satisfied In A Heap A For Depth D It Must Contain No More Than 2 D Nodes B All L 2 (17.95 KiB) Viewed 7 times
Which of these constraints must be satisfied in a heap? A. For depth d, it must contain no more than 2*d nodes. B. All leaves must live on deepest layer and next-to-deepest layer if needed C. Ordering must be preserved. D. none of these
There are n people at a dinner. Each person shakes hands with every other person at the dinner. For example for n=3: A, B, and C would produce handshakes between (A,B),(A,C), (B,C) If you simulated the handshake process with an algorithm, what would be the time complexity of the algorithm? A. O(n/2) B. O(n) C. O(log₂n) D. O(n²)
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!