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
64

Data structures and Algorithms MCQ with Answers

64) A full binary tree with n non-leaf nodes contains

log n nodes

n + 1 nodes

2n-1 nodes

2n + 1 nodes

Answer is:

2n + 1 nodes

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

65) If this tree is used for sorting, then new no 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

66) A 3-ary tree in which every internal node has exactly 3 children. The number of leaf nodes in such a tree with 6 internal nodes will be

10

9

12

13

Answer is:

13

67) A complete binary tree of level 5 has how many nodes ?

15

25

63

30

Answer is:

63

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