- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Trees
- Which of the following is incorrect with...

Q. |
## Which of the following is incorrect with respect to binary trees? |

A. | Let T be a binary tree. For every k ≥ 0, there are no more than 2k nodes in level k |

B. | Let T be a binary tree with λ levels. Then T has no more than 2λ – 1 nodes |

C. | Let T be a binary tree with N nodes. Then the number of levels is at least ceil(log (N + 1)) |

D. | Let T be a binary tree with N nodes. Then the number of levels is at least floor(log (N + 1)) |

Answer» D. Let T be a binary tree with N nodes. Then the number of levels is at least floor(log (N + 1)) |

View all MCQs in:
Data Structures (DS)

- trees are B-trees of order 4. They are an isometric of trees.
- Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
- When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
- Why to prefer red-black trees over AVL trees?
- An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by
- If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?
- What is the possible number of binary trees that can be created with 3 nodes, giving the sequence N, M, L when traversed in post-order.
- The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
- A binary tree of depth "d" is an almost complete binary tree if __________.
- Which of the following statement is incorrect with respect to infix to postfix conversion algorithm?

Login to Continue

It will take less than 2 minutes

Report MCQ