Time Left - 12:00 mins
Data Structure & Programming : Nuclear Quiz 2
Attempt now to get your rank among 239 students!
How many distinct binary trees can be constructed with three nodes?
What is the average case time complexity for finding the height of the binary tree?
Which one of the following array elements represents a binary min-heap?
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 in that order. The level-order traversal of the heap after the insertion of the elements is
What is the meaning of following declaration?
The address field of linked list:
The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
Which of the following is useful in traversing a given by breadth first search?
The data structure needed to convert infix notation to prefix notation is
The postfix equivalent of the tree whose prefix order is → * + ab – cd is:
- 239 attempts
- 0 upvotes
- 6 comments
Jul 27GATE & PSU CS
Priya UpadhyayMember since Sep 2020Priya Upadhyay