Register

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

• recategorized by
5,589 views

2 Answers

Best answer
3 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
1 1 vote

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

Voting & Accepting an answer helps improve the community
Answer:
← Previous · UGC NET CSE | July 2...Next → · UGC NET CSE | Decemb...
← Previous in category · UGC NET CSE | Decemb...Next in category → · UGC NET CSE | June 2...
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
10.4k
10.4k views
go_editor asked Jul 10, 2016
10,431 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?1234
3 3 votes
2 2 answers
8.9k
8.9k views
go_editor asked Jul 8, 2016
8,929 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 TreeAVL TreeThreaded Binary TreeComplete Binary Tree
4 4 votes
1 answers 1 answer
6.4k
6.4k views
im.raj asked Jun 16, 2016
6,439 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 forSearch and Insert OperationsSearch and Delete OperationsInsert and Delete O...
5 5 votes
2 answers 2 answers
5.5k
5.5k views
go_editor asked Jul 11, 2016
5,453 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}$