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

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. The following given tree is an example for?

  • (A) Binary tree
  • (B) Binary search tree
  • (C) Fibonacci tree
  • (D) none

A

Admin • 833.24K Points
Coach

Q. How many common operations are performed in a binary tree?

  • (A) 1
  • (B) 2
  • (C) 3
  • (D) 4

A

Admin • 833.24K Points
Coach

Q. What is the traversal strategy used in the binary tree?

  • (A) depth-first traversal
  • (B) breadth-first traversal
  • (C) random traversal
  • (D) Priority traversal

A

Admin • 833.24K Points
Coach

Q. How many types of insertion are performed in a binary tree?

  • (A) 1
  • (B) 2
  • (C) 3
  • (D) 4

A

Admin • 833.24K Points
Coach

Q. What operation does the following diagram depict?

  • (A) inserting a leaf node
  • (B) inserting an internal node
  • (C) deleting a node with 0 or 1 child
  • (D) none

A

Admin • 833.24K Points
Coach

Q. How many bits would a succinct binary tree occupy?

  • (A) n+O(n)
  • (B) 2n+O(n)
  • (C) n/2
  • (D) n

A

Admin • 833.24K Points
Coach

Q. The average depth of a binary tree is given as?

  • (A) O(N)
  • (B) O(√N)
  • (C) O(N2)
  • (D) O(log N)

A

Admin • 833.24K Points
Coach

Q. How many orders of traversal are applicable to a binary tree (In General)? 3

  • (A) 1
  • (B) 4
  • (C) 2
  • (D) 3

A

Admin • 833.24K Points
Coach

Q. If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?

  • (A) 2i+1
  • (B) 2i+2
  • (C) 2i
  • (D) 4i

A

Admin • 833.24K Points
Coach

Q. Using what formula can a parent node be located in an array?

  • (A) (i+1)/2
  • (B) (i-1)/2
  • (C) i/2
  • (D) 2i/2