MCQ | Data Structure Part 4

Data Structure - PART 4

« Previous Next »

1. Which of the following process is faster for threaded trees compared with their unthreaded

A. Insertion
B. Traversal
C. Deletion
D. None of these

  [NET]

Answer: B - Traversal

---

2. Inorder traversal of the binary search tree implies visiting records

A. the order of increasing magnitude of their key
B. the order of decreasing magnitude of their key
C. Arbitrary order
D. None of these

  [NET]

Answer: A - the order of increasing magnitude of their key

---

3. Level of any node of a tree is

A. its distance from the root
B. height of its left subtree minus height of its right subtree
C. height of its right subtree minus height of its left subtree
D. None of these

  [NET]

Answer: A - its distance from the root

---

4. A dynamic data structure where we can search for desired records in Bigo(log n) time is

A. heap
B. array
C. circular link list
D. binary search tree

  [NET]

Answer: D - binary search tree

---

5. How many cycles must be contained in a tree

A. one
B. zero
C. at least one
D. two

  [NET]

Answer: B - zero

---

6. The maximum number of nodes in a binary tree of depth 5 is

A. 31
B. 16
C. 32
D. 15

  [NET]

Answer: A - 31

---

7. Post order traversal of a binary tree starts with

A. Processing of the root node 
B. Postorder traversal of the left subtree
C. Postorder traversal of the right subtree
D. None of these

  [NET]

Answer: B - Postorder traversal of the left subtree

---

8. Number of all posible binary trees with 4 nodes is

A. 34
B. 14
C. 24
D. None of these

  [NET]

Answer: B - 14

---

9. A tree where each node have ____ children is called binary tree

A. 3
B. 2
C. 4
D. None of these

  [NET]

Answer: A - 2

---

10. Which of the following steps is performed first for inorder traversal of a binary tree

A. Traversal of the left subtree in postorder
B. Processing of the root node
C. Traversal of the left sub tree in inorder
D. None of these

  [NET]

Answer: A - Traversal of the left subtree in postorder

---

« Previous Next »