A-2-3 tree is a tree such that <br /> 1. All internal nodes have either 2 or 3 children. <br /> 2. All paths from root to the leaves have the same length. <br /> The number of internal nodes of a 2-3 tree having 9 leaves could be

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
78

Data structures and Algorithms MCQ with Answers

78) A-2-3 tree is a tree such that
1. All internal nodes have either 2 or 3 children.
2. All paths from root to the leaves have the same length.
The number of internal nodes of a 2-3 tree having 9 leaves could be

Answer is:

4

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

79) A binary tree is generated by inserting in order the following integers:
50, 15, 62, 5, 20,58, 91, 3,8,37, 60, 24 . The number of nodes in the left of the root respectively is

(4,7)

(7,4)

(6,3)

(3,6)

Answer is:

(7,4)

80) Consider the following nested representation of binary trees indicates y and z are the left right subtrees, respectively, of node x. Note that y and z may be NULL or further nested. Which of the following represents a valid binary tree ?

(1 2(4 5 6 7))

1((2 3 NULL)4 5 6)7)

(1(234)(567)

(1(2 3 NULL)(4 5))

Answer is:

(1(234)(567)

81) B+- trees are preferred to binary trees in databases because

Disk capacities are greater than memory capacities

Disk access is much slower than memory Access

Disk data transfer rates are much less than memory data transfer rates.

All of above

Answer is:

Disk access is much slower than memory Access

82) Which of the following statements is true?

A full binary tree with n non-leaf nodes contains log₂n nodes

A full binary tree with n non-leaf nodes contains n - 1 nodes

A full binary tree with n non-leaf nodes contains 2n nodes

A full binary tree with n non-leaf nodes contains 2n + 1 nodes

Answer is:

A full binary tree with n non-leaf nodes contains 2n + 1 nodes

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

78) A-2-3 tree is a tree such that 1. All internal nodes have either 2 or 3 children. 2. All paths from root to the leaves have the same length. The number of internal nodes of a 2-3 tree having 9 leaves could be

4

Data structures and Algorithms MCQ with Answers

Related Data structures and Algorithms MCQ with Answers

79) A binary tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20,58, 91, 3,8,37, 60, 24 . The number of nodes in the left of the root respectively is

(7,4)

80) Consider the following nested representation of binary trees indicates y and z are the left right subtrees, respectively, of node x. Note that y and z may be NULL or further nested. Which of the following represents a valid binary tree ?

(1(234)(567)

81) B+- trees are preferred to binary trees in databases because

Disk access is much slower than memory Access

82) Which of the following statements is true?

A full binary tree with n non-leaf nodes contains 2n + 1 nodes

Data structures and Algorithms MCQ with Answers

78) A-2-3 tree is a tree such that
1. All internal nodes have either 2 or 3 children.
2. All paths from root to the leaves have the same length.
The number of internal nodes of a 2-3 tree having 9 leaves could be

79) A binary tree is generated by inserting in order the following integers:
50, 15, 62, 5, 20,58, 91, 3,8,37, 60, 24 . The number of nodes in the left of the root respectively is