Data Structure Test Set 1

Data Structure Test Set 1

Q1➡ |
A binary tree T has n leaf nodes. The number of nodes of degree 2 in T is
i ➥ Log2n
ii ➥ n-1
iii ➥ n
iv ➥ 2n

Q2➡ |
In the balanced binary tree in the below figure, how many nodes will become unbalanced when a node is inserted as a child of the node “g”?
5.	In the balanced binary tree in the below figure, how many nodes will become unbalanced when a node is inserted as a child of the node “g”?
i ➥ 1
ii ➥ 3
iii ➥ 7
iv ➥ 8

Q3➡ |
Which of the following sequences denotes the post order traversal sequence of the given tree?
5.	In the balanced binary tree in the below figure, how many nodes will become unbalanced when a node is inserted as a child of the node “g”?
i ➥ f e g c d b a
ii ➥ g c b d a f e
iii ➥ g c d b f e a
iv ➥ f e d g c b a

Q4➡ |
A binary search tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24. The number of nodes in the left subtree and right subtree of the root respectively is
i ➥ (4, 7)
ii ➥ (7, 4)
iii ➥ (8, 3)
iv ➥ (3, 8)

Q5➡ |
A binary search tree is used to locate the number 43. Which one of the following probe sequence is not possible?
i ➥ 61, 52, 14, 17, 40, 43
ii ➥ 10, 65, 31, 48, 37, 43
iii ➥ 81, 61, 52, 14, 41, 43
iv ➥ 17, 77, 27, 66, 18, 43

Weekly Test GATE/NTA NET CSA

3 thoughts on “Data Structure Test Set 1”

Leave a Reply

Your email address will not be published.

error: Content is protected !!
Open chat
1
Hi,how Can We Help You ?