Concept drill
3-ary-heap
GATE CSE & IT · Data Structures · 2006-2006
2
PYQs
100%
keyed
0
elite explanations
1
years appeared
Study anchor
Cormen et al. — Introduction to Algorithms (CLRS)
Algorithms, data structures, graph algorithms, complexity
Practice action
Start latest PYQPYQs in this concept
All concepts →2006 PYQ
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 firs...
mediumanswer key
2006 PYQ
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 firs...
mediumanswer key