1
GATE CSE 2021 Set 2
Numerical
+1
-0

Consider a complete binary tree with 7 nodes. Let A denote the set of first 3 elements obtained by performing Breadth-First Search (BFS) starting from the root. Let B denote the set of first 3 elements obtained by performing Depth-First Search (DFS) starting from the root.

The value of |A - B| is _______

Your input ____
2
GATE CSE 2021 Set 1
MCQ (Single Correct Answer)
+1
-0.33

Consider the following statements.

S1 : The sequence of procedure calls corresponds to a preorder traversal of the activation tree.

S2 : The sequence of procedure returns corresponds to a postorder traversal of the activation tree.

Which one of the following options is correct?

A
S1 is true and S2 is true
B
S1 is false and S2 is true
C
S1 is false and S2 is false
D
S1 is true and S2 is false
3
GATE CSE 2020
MCQ (Single Correct Answer)
+1
-0.33
The preorder traversal of a binary search tree is 15, 10, 12, 11, 20, 18, 16, 19. Which one of the following is the postorder traversal of the tree?
A
20, 19, 18, 16, 15, 12, 11, 10
B
10, 11, 12, 15, 16, 18, 19, 20
C
11, 12, 10, 16, 19, 18, 20, 15
D
19, 16, 18, 20, 11, 12, 10, 15
4
GATE CSE 2020
MCQ (Single Correct Answer)
+1
-0.33
What is the worst case time complexity of inserting n2 elements into an AVL-tree with n elements initially?
A
$$\Theta \left( {{n^2}} \right)$$
B
$$\Theta \left( {{n^2}\log n} \right)$$
C
$$\Theta \left( {{n^4}} \right)$$
D
$$\Theta \left( {{n^3}} \right)$$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP