Question 56
In a binary heap stored with 1-based indexing, what is the left child index of i?
Detailed Solution
For 1-based heaps, children are at 2i and 2i+1.
✓ Saved
GATE CSE Trees – Data Structures Practice Test | Set 1
Your score
0/100
0 answered
Correct 0
Incorrect 0
Unanswered 100
Accuracy 0%
Question 57
In a binary heap stored with 1-based indexing, what is the right child index of i?
Detailed Solution
For 1-based heaps, right child is 2i+1.
✓ Saved
Question 58
Which structure is a complete binary tree satisfying the heap-order property?
Detailed Solution
A binary heap is a complete binary tree with heap order.
✓ Saved
Question 59
What is the minimum number of nodes in an AVL tree of height h using N(0)=1 and N(1)=2?
Detailed Solution
The minimum AVL tree combines minimum trees of heights h-1 and h-2 plus the root.
✓ Saved
Question 60
What is the asymptotic height of a red-black tree with n nodes?
Detailed Solution
Red-black balancing guarantees logarithmic height.
✓ Saved