Bihar STET Computer Science – Data Structures & Algorithms SET-1

Questions 51-55 of 100

0% completed (0/100 answered)
Your score 0/100 0 answered
Correct 0 Incorrect 0 Unanswered 100 Accuracy 0%

Question 51

MCQ · Single Correct 1 mark

Which traversal of a binary search tree produces keys in non-decreasing order when duplicate keys are allowed by the implementation?

Answers for question 51

Question 52

MCQ · Single Correct 1 mark

What is the worst-case search time in an unbalanced binary search tree with n nodes?

Answers for question 52

Question 53

MCQ · Single Correct 1 mark

What is the balance factor of an AVL node if the left subtree height is 4 and the right subtree height is 2?

Answers for question 53

Question 54

MCQ · Single Correct 1 mark

Which AVL rotation is used for a Left-Left imbalance?

Answers for question 54

Question 55

MCQ · Single Correct 1 mark

Which property is guaranteed by a min-heap?

Answers for question 55
Scroll to Top