Recent questions tagged data-structures

2 votes
2 answers
1471
2 votes
1 answer
1472
The Inorder traversal of the tree will yield a sorted listing of elements of tree inBinary treeBinary search treeHeapsNone of the above
5 votes
3 answers
1473
A complete binary tree with $n$ non-leaf nodes contains$\log_{2}n$ nodes$n+1$ nodes$2n$ nodes$2n+1$ nodes
3 votes
1 answer
1474
2 votes
2 answers
1475
4 votes
5 answers
1477
Consider the following binary search tree T given below: Which node contains the fourth smallest element in T?QVWX
1 votes
2 answers
1478
5 votes
2 answers
1479
Can Someone explain either Tree or Stack method to trace out this recursion ?What is the output of this Program ?
2 votes
3 answers
1480
If the inorder traversal and preorder traversal of a binary tree having N elements are given, then what will be the time complexity of post order traversal and level orde...
9 votes
3 answers
1481
The average depth of a binary search tree is$O(n^{0.5})$$O(n)$$O(\log n)$$O(n \log n)$
1 votes
1 answer
1482
How many minimum queues are required to implement a priority queue?
1 votes
1 answer
1484
What are the 3 Most Prominent use of Data Structure That creates the requirement of Data structure in every programming language . ​
9 votes
2 answers
1485
The queue data structure is to be realized by using stack. The number of stacks needed would beIt cannot be implemented2 stacks4 stacks1 stack
7 votes
1 answer
1486
If the sequence of operations - push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop are performed on a stack, the sequence of popped out values2,2,1...
2 votes
1 answer
1487
0 votes
1 answer
1488
Suppose we have a circular array implementation of a queue, with 9 items in the queue stored at data[7] through data[15]. The CAPACITY is 19. Where does the push member f...
0 votes
1 answer
1489
What is the minimum number of edges which must be removed from a complete bipartite graph of six nodes K(6) so that the remaining graph is a planar?Explain with exp why y...
1 votes
1 answer
1491
If an array with n-element is given then what will be the time complexity of creating Binary tree and Binary Search tree?
4 votes
4 answers
1492
The in-order traversal of a tree resulted in FBGADCE. Then the pre-order traversal of that tree would result inFGBDECAABFGCDEBFGCDEAAFGBDEC
9 votes
7 answers
1494
If node A has three siblings and B is parent of A, what is the degree of A?0345
7 votes
4 answers
1495
A full binary tree with $n$ leaves contains$n$ nodes$\log_2 n$ nodes$2n-1$$2^n$ nodes
4 votes
2 answers
1496
The infix expression $A+(B-C)^*D$ is correctly represented in prefix notation as$A+B-C^*D$$+A^*-BCD$$ABC-D^*+$$A+BC-D^*$
4 votes
1 answer
1497
A complete binary tree with the property that the value at each node is at least as large as the values at its children is known asbinary search treeAVL treecompletely ba...
5 votes
3 answers
1498
2 votes
1 answer
1499
The time required to search an element in a linked list of length n is$O(\log_2 n)$$O(n)$$O(1)$$O(n^2)$