Data Structures MCQ Quiz - Multiple Choice Questions & Answers Page 3

21. A tree such that each node has at most two child nodes are called as .................... tree

1. Binary
2. Binary Search
3. Full Binary
4. Strictly Binary

22. A tree such that each node has exactly two child nodes or no nodes is called as .................... tree

1. Binary
2. Binary Search
3. Full Binary
4. Strictly Binary

23. A tree such that each node has exactly two child nodes and all leaf nodes are at the same level is called as .................... tree

1. Binary
2. Binary Search
3. Full Binary
4. Strictly Binary

24. In circular link list the link field of the last node points to

1. NULL
2. First node
3. next element location
4. itself

25. The linked list data structure usage offers saving in

1. time
2. space
3. both time & space
4. none

26. Visiting the root node first is called

1. inorder traversal
2. preorder traversal
3. postorder traversal
4. none

27. Visiting the root node last is called

1. inorder traversal
2. preorder traversal
3. postorder traversal
4. none

28. Visiting the root node just before visiting the right subtree is called

1. inorder traversal
2. preorder traversal
3. postorder traversal
4. none

29. Insertion and deletion of a node in the linked list can be done

1. at the beginning
2. at the end
3. any where in the linked list
4. not possible at all

30. An ordered collection of data items is called

1. list
2. sequential list
3. linked list
4. none