www.ThinkITI.com

Home
MCQ
Search
Free Apps
Important
Study Groups
Contact Us
Policy

Home
MCQ
Objective Questions
Engineering
Computer Science
Computer Science Set-1
Data structures and Algorithms
84

Data structures and Algorithms MCQ with Answers

84) If the post order traversal gives a b - c d * + then the label of the nodes 1, 2, 3 ... will be

+, -, *, a, b, c, d

a, -, b, +, c, *, d

a, b, c, d, -, *, +

-, a, b, +, *, c, d

Answer is:

+, -, *, a, b, c, d

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

85) Consider the following tree : If this tree is used for sorting, then a new number 8 should be placed as the

left child of the node labelled 30

right child of the node labelled 5

right child of the node labelled 30

left child of the node labelled 10

Answer is:

left child of the node labelled 10

86) The number of possible ordered trees with 3 nodes A, B, C is

16

12

6

10

Answer is:

12

87) A binary tree in which every non-leaf node has non-empty left and right sub-trees is called a strictly binary tree. Such a tree with 20 leaves

cannot have more than 19 nodes

has exactly 19 nodes

has exactly 17 nodes

None of these

Answer is:

None of these

88) The depth of a complete binary tree with 'n nodes is (log is to be base two)

log (n+1)-1

log(n)

log (n-1) + 1

log(n) + 1

Answer is:

log (n+1)-1

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here