Nhóm 3 CSD201 SLIDE 8-9-10

What is Preorder Traversal?

• A. Visiting a node after visiting its children
  

• B. Visiting a node before visiting its children
  

• C. Visiting nodes level by level

• D. Visiting the right child before the left child

What is the final step in Postorder Traversal?

• A. Visiting the parent node

• B. Visiting child nodes

• C. Visiting nodes level by level

3. In a pre-order traversal, in what order are the nodes visited?

• • Left child → Right child → Root

• • Root → Left child → Right child

• • Left child → Root → Right child

• • Right child → Left child → Root

1. What is the degree (order) of a node in a tree?

• • The number of ancestors of the node.

• • The number of edges from the node to the root.

• • The number of non-empty children of the node.

• • The number of leaf nodes in the subtree of the node.

11. How does Breadth-First Traversal differ from Preorder Traversal?

• 11. It visits all nodes at the same level before going deeper

• 11. It visits the root first, then recursively visits child nodes
      

• 11. It visits nodes in random order
      

• 11. There is no difference

What is a common application of Breadth-First Traversal?

• A. Breadth-First Search

• B. Computing total directory size

• C. Printing structured documents
  

• D. Checking tree symmetry

5. Which of the following is a correct pre-order traversal for the tree shown below?
   (Tree example: Root = F, Left subtree = B, Right subtree = G, B's children = A, D, G's child = I, D's children = C, E, I’s child = H)

• • A, B, C, D, E, F, G, H, I,

• A, C, E, D, B, H, I, G, F

• • F, B, A, D, C, E, G, I, H

• • F, G, I, H, B, D, C, E, A