- Computer Science Engineering (CSE)
- Data Structures (DS)
- In a directed tree any node which has ou...

Q. |
## In a directed tree any node which has out degree 0 is called a terminal node or__________. |

A. | a tree. |

B. | a list. |

C. | a node. |

D. | a leaf. |

Answer» D. a leaf. |

View all MCQs in:
Data Structures (DS)

- In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.
- What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?
- 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 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
- When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
- B-tree of order n is a order-n multiway tree in which each non-root node contains
- If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
- Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?
- The number of edges from the root to the node is called of the tree.

Login to Continue

It will take less than 2 minutes

Report MCQ