Recent questions tagged data-structures

2 votes
2 answers
1442
Convert the following infix expression into its equivalent post fix expression $ (A + B$^$ D) / (E – F) + G $$ABD$^ $+EF – / G+$$ABD + $^$EF – / G+$$ABD +$ ^$EF / �...
1 votes
2 answers
1444
The efficient data structure to insert/delete a number in a stored set of number isQueueLinked listDoubly linked listBinary tree
3 votes
2 answers
1448
4 votes
3 answers
1452
4 votes
3 answers
1453
2 votes
1 answer
1454
If we have to construct the expression tree from this expression (3 + ((5+9)*2)) then what will be the order of push and pop operation on a stack ?Explain what to do with...
1 votes
0 answers
1457
1 votes
1 answer
1458
1 votes
2 answers
1459
Which of the following permutations can be obtained in the output using a stack of size 3 elements assuming that input, sequence is 1, 2, 3, 4, 5?3, 2, 1, 5, 45, 4, 3, 2,...
0 votes
2 answers
1461
Given an empty stack, after performing push(1), push(2), pop, push(3), push(4), pop, pop, push(5), pop, what is the value of the top of the stack?4321
5 votes
3 answers
1462
1 votes
1 answer
1463
0 votes
1 answer
1464
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 votes
2 answers
1467
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
1 votes
2 answers
1468
The following postfix expression is evaluated using a stack. 823^/23*+51*- . The top two elements of the stack after first * is evaluated6,15, 73,21, 5
1 votes
1 answer
1469
3 votes
2 answers
1470
To represent hierarchical relationship between elements, which data structure is suitable?DequeuePriorityTreeAll of the above