- Computer Science Engineering (CSE)
- Data Structure (DS)
- A binary tree in which all its levels ex...

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 |

View all MCQs in:
Data Structure (DS)

- A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
- To perform level-order traversal on a binary tree, which of the following data structure will be required?
- A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
- A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
- The property of binary tree is
- A graph is a tree if and only if graph is
- A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
- A linear list in which each node has pointers to point to the predecessor and successors nodes is called as
- Which if the following is/are the levels of implementation of data structure
- Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?

Login to Continue

It will take less than 2 minutes

Report MCQ