- Computer Science Engineering (CSE)
- Data Structures (DS)
- ______________ a tree means processing i...

Q. |
## ______________ a tree means processing it in such a way that each node is visited only once. |

A. | Traversing. |

B. | Implement. |

C. | Partition. |

D. | Node. |

Answer» A. Traversing. |

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.
- B-tree of order n is a order-n multiway tree in which each non-root node contains
- ____________ is finding a path/tour through the graph such that every vertex is visited exactly once.
- 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.
- In a directed tree any node which has out degree 0 is called a terminal node or__________.
- 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
- 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___________.
- A linked list whose last node points back to the list node instead of containing the null pointer________.
- A _________is a linked list which always contains a special node called the header node, at the beginning of the list.

Login to Continue

It will take less than 2 minutes

Report MCQ