Recent questions tagged tbb-ds-2

0 votes
1 answer
2
2 votes
1 answer
4
Which one of the following is the tightest upper bound that represents the time complexity of inserting an element into a binary search tree of n nodes?O(1)O(n log n)O(n)...
1 votes
1 answer
6
1 votes
0 answers
7
The following sequence of operation is performed on stack : push(1),push(2),pop,push(1),push(2),pop,pop,pop,push(2),pop.The sequence of popped out values are?2,1,2,2,12,1...
6 votes
2 answers
11
2 votes
1 answer
12
The resultant array after first iteration of bubble sort on $10,20,6,5,30, 8$ is _________.$10 , 6,5,20,8,30$$10 , 6,5,20,30,8$$10 , 5,6,20,8,30$$10 , 6,5,30,8,20$
0 votes
1 answer
13
The following keys are inserted in an empty binary search tree (and height of the root of tree is $1$).Keys are: $11, 10, 1, 9, 7, 4, 3, 2, 6, 8, 5, 12$The height of the ...
0 votes
1 answer
14
Two adjacent edges in a simple graph are said to be in series if their common vertex is of degree ____.1234
2 votes
1 answer
15
2 votes
1 answer
16
1 votes
1 answer
18
1 votes
1 answer
19
A binary tree has 10 nodes , the in-order and pre-order traversal of the tree isPre order: A B D E H J C F I GIn order - D B H J E A I F C GTotal number of leaf nodes i...
1 votes
1 answer
20
The concatenation of $2$ lists is to be performed in $O(1)$ time. Which of the following implementations should be used?array implementation of listdoubly linked listsing...
1 votes
1 answer
26
Consider the following sequence $( 50,17,14,8, 13,10, 2,5,7,12)$ what is the Minimum number of interchanges required to make it Max heap?$4$$2$$3$$0$
3 votes
1 answer
28
In Tower of Hanoi problem if the condition that A larger disk can not be kept on a smaller disk is removed, then the number of moves required to move $n$ disks$2n - n$$...
2 votes
1 answer
29
2 votes
3 answers
30
To see more, click for the full list of questions or popular tags.