Register

UGC NET CSE | December 2012 | Part 2 | Question: 40

• recategorized by
4,931 views

2 Answers

Best answer
3 votes
3 votes
Operation push(1) push(2) pop push(3) push(4) pop pop push(5) pop
          4        
    2   3 3 3   5  
  1 1 1 1 1 1 1 1 1

Hence,Option(D)1 is the correct choice.

• selected by
User Avatar
2 votes
2 votes

Answer: 1

Push 1    Push 2

 1    Pop 2

1     Push 3    Push 4 

1     Pop 4     Pop 3

1     Push 5  

1     Pop 5

1    <=== Answer

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
go_editor asked Jul 10, 2016
8,079 views
UGC NET CSE | December 2012 | Part 2 | Question: 26
A hash function $f$ defined as $f (key) = key \mod 13$, with linear probing is used to insert keys 55, 58, 68, 91, 27, 145. What will be the location of 79? 1 2 3 4
A hash function $f$ defined as $f (key) = key \mod 13$, with linear probing is used to insert keys 55, 58, 68, 91, 27, 145. What will be the location of 79?1234
User Avatar
3 votes
3 votes
2 answers
2
go_editor asked Jul 8, 2016
6,733 views
UGC NET CSE | December 2012 | Part 2 | Question: 16
In which tree, for every node the height of its left subtree and right subtree differ almost by 1? Binary Search Tree AVL Tree Threaded Binary Tree Complete Binary Tree
In which tree, for every node the height of its left subtree and right subtree differ almost by 1?Binary Search TreeAVL TreeThreaded Binary TreeComplete Binary Tree
User Avatar
2 votes
2 votes
1 answer
3
im.raj asked Jun 16, 2016
5,417 views
UGC NET CSE | December 2012 | Part 2 | Question: 2
The worst case time complexity of AVL is tree is better in comparison to binary search tree for Search and Insert Operations Search and Delete Operations Insert and Delete Operations Search, Insert and Delete Operations
The worst case time complexity of AVL is tree is better in comparison to binary search tree forSearch and Insert OperationsSearch and Delete OperationsInsert and Delete O...
User Avatar
4 votes
4 votes
2 answers
4
go_editor asked Jul 11, 2016
4,457 views
UGC NET CSE | December 2012 | Part 2 | Question: 34
The maximum number of keys stored in a B-tree of order $m$ and depth $d$ is $m^{d +1}-1$ $\frac{m^{d+1}-1}{m-1}$ $(m-1)(m^{d+1}-1)$ $\frac{m^d-1}{m-1}$
The maximum number of keys stored in a B-tree of order $m$ and depth $d$ is$m^{d +1}-1$$\frac{m^{d+1}-1}{m-1}$$(m-1)(m^{d+1}-1)$$\frac{m^d-1}{m-1}$
User Avatar
Link Copied!