6Is heap sort stable?AOnly for integersBOnly for small arraysCYesDNoView AnswerDiscussWorkspaceReportSaveEasy
7The height of a binary heap with n elements is:An/2B√nC⌊log₂ n⌋DnView AnswerDiscussWorkspaceReportSaveEasy
8What is the output of the following code?import heapq print(heapq.nlargest(2, [4, 9, 1, 7]))A[9, 7]B[9, 4]C[1, 4]D[7, 9]View AnswerDiscussWorkspaceReportSaveEasy
9A binary heap is always a:ABalanced BSTBComplete binary treeCBinary search treeDFull binary treeView AnswerDiscussWorkspaceReportSaveEasy
10For a heap stored in an array with 0-based indexing, the parent of the node at index 9 is at index:A8B5C3D4View AnswerDiscussWorkspaceReportSaveMedium