ComputerNetworks
October 9, 2023HeapTree
October 9, 2023HeapTree
Question 7

A 3ary max heap is like a binary max heap, but instead of 2 children, nodes have 3 children. A 3ary heap can be represented by an array as follows: The root is stored in the first location, a[0], nodes in the next level, from left to right, is stored from a[1] to a[3]. The nodes from the second level of the tree from left to right are stored from a[4] location onward. An item x can be inserted into a 3ary heap containing n items by placing x in the location a[n] and pushing it up the tree to satisfy the heap property.
Which one of the following is a valid sequence of elements in an array representing 3ary max heap?
1, 3, 5, 6, 8, 9


9, 6, 3, 1, 8, 5


9, 3, 6, 8, 5, 1


9, 5, 6, 8, 3, 1

Question 7 Explanation:
Correct Answer: D
Question 7 Explanation:
Subscribe
Login
0 Comments