Skip to content
Related Articles
Get the best out of our app
Open App

Related Articles

Data Structures | Heap | Question 3

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

A 3-ary max heap is like a binary max heap, but instead of 2 children, nodes have 3 children. A 3-ary 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 3-ary 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 3-ary max heap?
(A) 1, 3, 5, 6, 8, 9
(B) 9, 6, 3, 1, 8, 5
(C) 9, 3, 6, 8, 5, 1
(D) 9, 5, 6, 8, 3, 1

Answer: (D)

Explanation: Following 3-ary Max Heap can be constructed from sequence given option (D)

                                   /  |   \
                                /     |     \
                              5       6      8
                           /  |
                         /    |
                       3      1

Quiz of this Question

My Personal Notes arrow_drop_up
Last Updated : 28 Jun, 2021
Like Article
Save Article
Similar Reads
Related Tutorials