Data Structure and Algorithms (DSA) MCQs with answers Page - 79

Here, you will find a collection of MCQ questions on Data Structure and Algorithms (DSA). Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 833.24K Points
Coach

Q. Which of the following pair’s traversals on a binary tree can build the tree uniquely?

  • (A) post-order and pre-order
  • (B) post-order and in-order
  • (C) post-order and level order
  • (D) level order and preorder

A

Admin • 833.24K Points
Coach

Q. The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.

  • (A) O(n log n)
  • (B) O(n)
  • (C) O(n2)
  • (D) O(log n)

A

Admin • 833.24K Points
Coach

Q. An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by

  • (A) At least one
  • (B) At most one
  • (C) Two
  • (D) At most two

A

Admin • 833.24K Points
Coach

Q. Associative arrays can be implemented using

  • (A) B-tree
  • (B) A doubly linked list
  • (C) A single linked list
  • (D) A self balancing binary search tree

A

Admin • 833.24K Points
Coach

Q. Which of the following is a self – balancing binary search tree?

  • (A) 2-3 tree
  • (B) Threaded binary tree
  • (C) AA tree
  • (D) Treap

A

Admin • 833.24K Points
Coach

Q. A self – balancing binary search tree can be used to implement

  • (A) Priority queue
  • (B) Hash table
  • (C) Heap sort
  • (D) Priority queue and Heap sort

A

Admin • 833.24K Points
Coach

Q. In which of the following self – balancing binary search tree the recently accessed element can be accessed quickly?

  • (A) AVL tree
  • (B) AA tree
  • (C) Splay tree
  • (D) Red – Black tree

A

Admin • 833.24K Points
Coach

Q. The minimum height of self balancing binary search tree with n nodes is

  • (A) log2(n)
  • (B) n
  • (C) 2n + 1
  • (D) 2n – 1

A

Admin • 833.24K Points
Coach

Q. What is an AVL tree?

  • (A) a tree which is balanced and is a height balanced tree
  • (B) a tree which is unbalanced and is a height balanced tree
  • (C) a tree with three children
  • (D) a tree with atmost 3 children

A

Admin • 833.24K Points
Coach

Q. Why we need to a binary tree which is height balanced?

  • (A) to avoid formation of skew trees
  • (B) to save memory
  • (C) to attain faster memory access
  • (D) to simplify storing

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.