- Computer Science Engineering (CSE)
- Data Structures (DS)
- When converting binary tree into extende...

Q. |
## When converting binary tree into extended binary tree, all the original nodes in binary tree are___________. |

A. | internal nodes on extended tree. |

B. | external nodes on extended tree. |

C. | vanished on extended tree. |

D. | post order traversal. |

Answer» A. internal nodes on extended tree. |

View all MCQs in:
Data Structures (DS)

- The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
- 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
- In a full binary tree if number of internal nodes is I, then number of nodes N are?
- In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.
- 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 __________.
- In a full binary tree if number of internal nodes is I, then number of leaves L are?
- In a full binary tree if there are L leaves, then total number of nodes N are?
- The minimum height of self balancing binary search tree with n nodes is
- The number of nodes in a complete binary tree of level 5 is__________.

Login to Continue

It will take less than 2 minutes

Report MCQ