Question
A d-ary heap is a like a binary heap, but (with one possible exception)
non-leaf nodes have d children instead of 2 children. What would be
the procedures to map a node with index i to its parent and its jth
child, given the heap is represented using an array.
A d-ary heap is a like a binary heap, but (with one possible exception)
non-leaf nodes have d children instead of 2 children. What would be
the procedures to map a node with index i to its parent and its jth
child, given the heap is represented using an array.
Answer: Option A
Submit Your Solution Below and Earn Points !
Submit Your Solution Below and Earn Points !
More Questions on This Topic :
Latest Videos
Latest Test Papers
Submit Solution