McqMate

Q. |
## A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree. |

A. | Threaded tree |

B. | Complete binary tree |

C. | M-way search tree |

D. | Full binary tree |

Answer» B. Complete binary tree |

4.9k

0

Do you find this helpful?

27

View all MCQs in

Data Structures (DS)No comments yet

- When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
- 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
- The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
- In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.
- The maximum number of nodes on level i of a binary tree is ___________.
- In a full binary tree if number of internal nodes is I, then number of nodes N are?
- 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 __________.
- 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
- The number of nodes in a complete binary tree of level 5 is__________.