in Education by
What is the ancestor of the leaf node in a given minimum ternary heap? (a) 1 (b) 10 (c) 18 (d) 20 Select the correct answer from above options Data Structures and Algorithms questions and answers

1 Answer

0 votes
by
 
Best answer
Correct choice is (a) 1 For explanation: Minimum ternary heap has the smallest element as its root node. The parent node is all either equal or less than children node in a minimum ternary heap. Ancestor is the node falling on the path from that node to the root node. So here ancestor of all leaf nodes is 1.

Related questions

0 votes
    You are asked to perform a queue operation using a stack. Assume the size of the stack is some value ... from above options Data Structures and Algorithms questions and answers...
asked Nov 14, 2021 in Education by JackTerrance
0 votes
    Naïve merge cannot be done in a skew merge. (a) true (b) false Select the correct answer from above options Data Structures and Algorithms questions and answers...
asked Nov 14, 2021 in Education by JackTerrance
0 votes
    In crabbing protocol to inset or delete a key value the leaf node has to be locked in ___________ ... Index Structures topic in section Concurrency Control of Database Management...
asked Oct 10, 2021 in Education by JackTerrance
0 votes
    How to get prints of shared object memory maps or heap memory maps for a given process? (a) jmap ... programming questions and answers pdf, java interview questions for beginners...
asked Oct 26, 2021 in Education by JackTerrance
...