樹的遍歷：練習題

Which tree-traversal algorithm would be most appropriate to use if you wanted to create a complete copy of a binary tree structure?

Which of the following describes the correct sequence of operations for a pre-order traversal of a rooted binary tree?

A binary tree is traversed and produces the following outputs:
Pre-order: F, B, A, D, C, E, G, I, H
In-order: A, B, C, D, E, F, G, H, I

What is the post-order traversal of this tree?

When performing an in-order traversal on a binary search tree (BST) containing numeric values, in what order will the contents be processed?

Which of the following describes a scenario where post-order traversal is essential for the correct operation of an algorithm?

What is one specific practical application of performing a Pre-order traversal on a rooted tree structure?

When performing an In-order traversal on a Binary Search Tree (BST) containing integer values, what is the characteristic property of the resulting output sequence?

A binary tree is used to represent a file directory system. Which traversal method would be used to delete a directory only after all of its sub-directories and files have been deleted?

A rooted tree is used to represent an arithmetic expression: \( (8 - 3) \times (4 + 2) \).

(a) Describe how an In-order traversal of this expression tree would look, including the placement of brackets.
(b) Perform a Post-order traversal on the tree and state the resulting sequence.
(c) Explain the relationship between the result of a post-order traversal and Reverse Polish Notation (RPN).

Consider a binary search tree (BST) where nodes are traversed using different methods.

(a) List the steps for an In-order traversal.
(b) Explain why an In-order traversal is particularly useful for a BST compared to other trees.
(c) Describe a practical use for Pre-order traversal.