- Computer Science Engineering (CSE)
- Data Structures (DS)
- A binary tree of depth "d" is an almost ...

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

A. | each leaf in the tree is either at level. |

B. | for any node. |

C. | both a and b. |

D. | None. |

Answer» C. both a and b. |

View all MCQs in:
Data Structures (DS)

- 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___________.
- The depth of a complete binary tree is given by__________.
- The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
- What is a complete binary tree?
- The number of nodes in a complete binary tree of level 5 is__________.
- The average depth of a binary tree is given as?
- In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.
- A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?
- Which of the following pair’s traversals on a binary tree can build the tree uniquely?

Login to Continue

It will take less than 2 minutes

Report MCQ