- Computer Science Engineering (CSE)
- Data Structure (DS)
- The property of binary tree is

Q. |
## The property of binary tree is |

A. | the first subset is called left subtree |

B. | the second subtree is called right subtree |

C. | the root cannot contain null |

D. | the right subtree can be empty |

Answer» D. the right subtree can be empty |

View all MCQs in:
Data Structure (DS)

- 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 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?
- …………………. Is a directed tree in which outdegree of each node is less than or equal to two.
- A graph is a tree if and only if graph is
- In general, the binary search method needs no more than ……………. comparisons.

Login to Continue

It will take less than 2 minutes

Report MCQ