GATEverse Practice, past papers & mock tests
GATE 2022
Programming & Data StructuresTreesmediumNAT1 mark
Suppose a binary search tree with 1000 distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with 0, the 3rd largest element of the tree is stored at index_____________.
Save your progress

Related Programming & Data Structures PYQs