Data Structures: ?Please answer #16-18 ASAP! Which of the following are properti
ID: 3680334 • Letter: D
Question
Data Structures: ?Please answer #16-18 ASAP!
Which of the following are properties of binary (min) heaps: The tree is a binary tree The tree does not have to be complete The missing nodes are on the left portion on the bottom level Both A and C In Quick-sort, when we pivot around an element, what are we doing? Searching for this element in the array, so that we can return its value. Removing all values greater than this element from the array, so that the pivot is the new max value. Dividing the array into two groups based on their relation to the pivoted element. Adding the pivoted element to a new array. The next element we pivot will be added, and put either in front of or behind the previously pivoted one. Sedgewick's gap sequence begins... 1, 2, 4, 8,... 1, 4, 9, 29,... 1, 2, 3, 4,... 1, 5, 19, 41,...Explanation / Answer
16)
option a) The tree is a binary tree
17)
ans:option c
18)
ans:option d
based on O(N4/3)
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.