chapter8-2

Example of linear data structure except

• array

• tree

• queue

• stack

What is the maximum number of children that a node can have in a binary tree?

• 3

• 1

• 4

• 2

To perform level-order traversal on a binary tree, which of the

following data structure will be required?

• Hash table

• Queue

• Binary search tree

• Stack

To represent hierarchical relationship between elements, which data structure is suitable?

• Dequeue

• Priority

• Tree

• Graph

A Binary Tree can have

• Can have 2 children

• Can have 1 children

• Can have 0 children

• All of the above

Process of inserting an element in stack is called ____________

• Create

• Push

• Evaluation

• Pop

Efficiency of an algorithm is measured by

• Time and Capacity complexity

• Time and Space complexity

• Speed and Space complexity

• Speed and Capacity complexity

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

• 2, 7, 2, 6, 5, 11, 5, 9, 4

• 2, 7, 5, 2, 6, 9, 5, 11, 4

• 2, 5, 11, 6, 7, 4, 9, 5, 2

• 2, 7, 5, 6, 11, 2, 5, 4, 9

Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?

• Pre-Order

• In-Order

• Post-Order

• Monastic Orders

Post order traversal :

• a+b*c+d*e+f*g

• abc*+de*f+g*+

• ++a*bc*+*defg

• abc+*+defg*+*