Engineering

Data Structure (DS) MCQs: 544 Questions & Answers in Engineering

544 Data Structure (DS) MCQs in Engineering with answers & explanations. Page 22. Practice objective questions for competitive exams, interviews & self-asses… Use the answer toggle below to show or hide all solutions, tap an option to check one question, or open a question for its own page.

Page 22 of 28

Show answers

Answers hidden — tap an option or use “View Answer” on each question.

421

Data Structure (DS) MCQs: 544 Questions & Answers in Engineering

What is the space complexity of a linear queue having n elements?

The following given tree is an example for?

How many common operations are performed in a binary tree?

What is the traversal strategy used in the binary tree?

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

What operation does the following diagram depict?

How many bits would a succinct binary tree occupy?

The average depth of a binary tree is given as?

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

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

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

Which of the following properties are obeyed by all three tree – traversals?

For the tree below, write the pre-order traversal.

For the tree below, write the post-order traversal.

What is the time complexity of pre-order traversal in the iterative fashion?

What is the space complexity of the post-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)

To obtain a prefix expression, which of the tree traversals is used?

Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is

What is the possible number of binary trees that can be created with 3 nodes, giving the sequence N, M, L when traversed in post-order.

The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be

Study tips for Data Structure (DS)