树的遍历 Tree traversal
（重定向自Postorder traversal）
在计算机科学里，树的遍历（也称为树的搜索）是graph traversal的一种，指的是按照某种规则，不重复地访问某种tree data structure的所有节点的过程。具体的访问操作可能是检查节点的值、更新节点的值等。不同的遍历方式，其访问节点的顺序是不一样的。以下虽然描述的是二叉树的遍历算法，但它们也适用于其他树形结构。
Postorder traversal
中文百科
英语百科
Tree traversal 树的遍历
（重定向自Postorder traversal）
![Pre-order: F, B, A, D, C, E, G, I, H.](/Images/godic/202502/03/Sorted_binary_tree_preorder.svg5115.png")
![In-order: A, B, C, D, E, F, G, H, I.](/Images/godic/202502/03/Sorted_binary_tree_inorder.svg5115.png")
![Post-order: A, C, E, D, B, H, I, G, F.](/Images/godic/202502/03/Sorted_binary_tree_postorder.svg5115.png")
![Level-order: F, B, G, A, D, I, C, E, H.](/Images/godic/202502/03/Sorted_binary_tree_breadth-first_traversal.svg5115.png")
In computer science, tree traversal (also known as tree search) is a form of graph traversal and refers to the process of visiting (checking and/or updating) each node in a tree data structure, exactly once. Such traversals are classified by the order in which the nodes are visited. The following algorithms are described for a binary tree, but they may be generalized to other trees as well.
- steeping in water for reconstitution
- steeping in wine
- steeping liquor
- steeping lye
- steeping machine
- steeping medium
- steeping press
- Steeping R.
- steeping tank
- steeping treatment
- steeping trough
- steeping vat
- steeping wool
- steep initial
- steep in water
- steep in wine
- steepish
- steep land
- steep land soil
- steeplebush
- steeplechase
- Steeplechaser
- steeple chase race
- steeplechasers
- steeplechasings