Recent questions tagged data-structures

18 votes
3 answers
421
10 votes
3 answers
422
Consider the following sequence of operations on an empty stack.$$\textsf{push}(54);\textsf{push}(52);\textsf{pop}();\textsf{push}(55);\textsf{push}(62);\textsf{s}=\texts...
1 votes
1 answer
424
A stack can be implemented using queue, but then we need to use atleast :$3$ queues$2$ queuesonly one queue is sufficientnone of the options
1 votes
1 answer
425
When we perform in order traversal on a binary tree, we get the ascending order array. The tree is:Heap treealmost complete binary treeBinary search treeCannot be determi...
1 votes
1 answer
427
1 votes
1 answer
428
A recursive problem like tower of hanoi can be rewritten without recursion using:stackpriority queuegraphcycles
3 votes
3 answers
430
In a binary max heap containing $n$ numbers, the smallest element can be found in ______$O(n)$$O(\log _2 n)$$O(1)$$O(\log_2 \log_2 n)$
1 votes
2 answers
432
2 votes
2 answers
434
A full binary tree with $n$ non-leaf nodes contains$\log_ 2 n$ nodes$n+1$ nodes$2n$ nodes$2n+1$ nodes
1 votes
1 answer
435
1 votes
2 answers
438
In a circularly linked list organization, insertion of a record involves the modification ofno pointer$1$ pointer$2$ pointers$3$ pointers
2 votes
2 answers
440
The average search time of hashing, with linear probing will be less if the load factoris far less than oneequals oneis far greater than onenone of these
2 votes
1 answer
441
1 votes
2 answers
442
1 votes
2 answers
443
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?$O(n),O(n)$$O(n),O(1)$$O(1),O(n)$$O(1),O(1)$