Articles by Team EasyExamNotes

GATE CS 2020 Post order traversal

The preorder traversal of a binary search tree is 15,10,12,11,20,18,16,19. Which one of the following is the postorder traversal of the tree? 1. 20,19,18,16,15,12,11,102. 11,12,10,16,19,18,20,153. … Read more

GATE CS 2014 Max Heap insertion

A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10,8,5,3,2. Two new elements 1 and 7 are inserted into the heap … Read more

GATE CS 2020 Min heap

Consider the array representation of a binary min-heap containing 1023 elements. The minimum number of comparisons required to find the maximum in the heap is … Read more

GATE CS 2023 Max Heap

Which one of the following sequences, when stored in an array at locations A[1],…,A[10] forms a max-heap? Practice Problem Which one of the following sequences when stored … Read more