Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Programming and Data Structure Tree Tree Traversal
The elements 30, 15, 18, 12, 23, 10, 14, 22, 25 are inserted one by one in the given order into a MAX-HEAP. Which number will be at position 8 in the level-order traversal of the MAX-HEAP if the index of the root is 1?
1
12
2
22
3
25
4
14