# 1. Traversal

- [Binary Tree Preorder Traversal](https://blog.yushunchen.com/algo/binary-tree/1.-traversal/binary-tree-preorder-traversal.md): ID: 144; easy
- [Binary Tree Inorder Traversal](https://blog.yushunchen.com/algo/binary-tree/1.-traversal/binary-tree-inorder-traversal.md): ID: 94; easy
- [Binary Tree Postorder Traversal](https://blog.yushunchen.com/algo/binary-tree/1.-traversal/binary-tree-postorder-traversal.md): ID: 145; easy
- [Construct Binary Tree from Inorder and Postorder Traversal](https://blog.yushunchen.com/algo/binary-tree/1.-traversal/construct-binary-tree-from-inorder-and-postorder-traversal.md): ID: 72; medium; 中序遍历和后序遍历树构造二叉树
- [Minimum Depth of Binary Tree](https://blog.yushunchen.com/algo/binary-tree/1.-traversal/minimum-depth-of-binary-tree.md): ID: 111; easy
- [Find Leaves of Binary Tree](https://blog.yushunchen.com/algo/binary-tree/1.-traversal/find-leaves-of-binary-tree.md): ID: 650; medium; 二叉树叶子顺序遍历
- [Reconstruct Itinerary](https://blog.yushunchen.com/algo/binary-tree/1.-traversal/reconstruct-itinerary.md): ID: 1288; medium;


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://blog.yushunchen.com/algo/binary-tree/1.-traversal.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.