adplus-dvertising
frame-decoration

Question

Which one of the following statements is false?

a.

Breadth-first search cannot be used to find connected components of a graph.

b.

Given the prefix and postfix walks of a binary tree, the binary tree cannot be uniquely reconstructed.

c.

Both (a) and (b)

d.

Optimal binary search tree construction can be performed efficiently using dynamic programmmg.

Answer: (c).Both (a) and (b)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which one of the following statements is false?

Similar Questions

Discover Related MCQs

Q. A list integers is read in, one at a time, and a binary search tree is constructed. Next the tree is traversed would result in a printout which duplicates the original order of the list of integers?

Q. Which of the following need not to be a binary tree ?

Q. Which of the following statements is false ?

Q. Which of the following remarks about Tree- indexing are true?

Q. A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is called

Q. A complete binary tree with the property that the value at each node is at least as large as the values at its children is called

Q. Traversing a binary tree first root and then left and right subtrees called _______traversal.

Q. A binary tree having n nodes and depth d will be about complete binary tree if

Q. Which of the following statements is/are correct ?

Q. A binary tree of depth "d" is an almost complete binary tree if

Q. If each node in a tree has value greater the every value in its left subtree and has value less than every value in its right subtree, the tree is called

Q. The number of nodes in a complete binary tree of level 5 is

Q. The smallest number of key that will force a B-tree of order 3 to have a height 3 is

Q. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves

Q. Number of possible binary trees with 3 nodes is

Q. 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

Q. 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

Q. 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?

Q. B+- trees are preferred to binary trees in databases because

Q. A full binary tree with n non-leaf nodes contains