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
68

Data structures and Algorithms MCQ with Answers

68) Traversing a binary tree first root and then left and right sub-trees called _______traversal.

post-order

pre-order

inorder

none of these

Answer is:

pre-order

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

69) A binary tree having n nodes and depth d will be about complete binary tree if

any node n_d at level less than d-1 has two sons

it contains log(d)+1 nodes

for any node n_d in the tree with a right descendent at level d lt must have a left son

all of these

Answer is:

any node n_d at level less than d-1 has two sons

70) Which of the following statements are correct ?
I. If each tree node contains a father field, then it's not necessary to use either stack or threads
II. Traversal using father pointers is more time efficient than traversal of a threaded tree
III. A in-threaded binary tree is defined as binary tree that is both left-in threaded and right-in threaded.

II and III

I and III

I and II

None of these

Answer is:

I and III

71) A binary tree of depth d is an almost complete binary tree if

each leaf in the tree is either at level

for any node

each leaf in the tree is either at level and for any node

None of these

Answer is:

each leaf in the tree is either at level and for any node

72) If each node in a tree has value greater the every value in its left sub-tree and has value less than every value in its right sub-tree, the tree is called

Complete tree

Full binary tree

Binary search tree

AVL tree

Answer is:

Binary search tree

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

68) Traversing a binary tree first root and then left and right sub-trees called _______traversal.

pre-order

Data structures and Algorithms MCQ with Answers

Related Data structures and Algorithms MCQ with Answers

69) A binary tree having n nodes and depth d will be about complete binary tree if

any node nd at level less than d-1 has two sons

I and III

71) A binary tree of depth d is an almost complete binary tree if

each leaf in the tree is either at level and for any node

72) If each node in a tree has value greater the every value in its left sub-tree and has value less than every value in its right sub-tree, the tree is called

Binary search tree

Data structures and Algorithms MCQ with Answers

any node n_d at level less than d-1 has two sons