mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-06 23:28:29 +08:00
Update
This commit is contained in:
@ -3,7 +3,10 @@ https://leetcode-cn.com/problems/binary-tree-inorder-traversal/
|
||||
|
||||
## 思路
|
||||
|
||||
题号:94,144,145 一起做一下
|
||||
094.二叉树的中序遍历
|
||||
144.二叉树的前序遍历
|
||||
145.二叉树的后序遍历
|
||||
建议一起做一下
|
||||
|
||||
## C++代码
|
||||
|
||||
|
@ -3,6 +3,11 @@ https://leetcode-cn.com/problems/binary-tree-preorder-traversal/
|
||||
|
||||
## 思路
|
||||
|
||||
094.二叉树的中序遍历
|
||||
144.二叉树的前序遍历
|
||||
145.二叉树的后序遍历
|
||||
建议一起做一下
|
||||
|
||||
实现树的遍历有使用递归和使用栈两种思路
|
||||
|
||||
## C++代码
|
||||
|
@ -3,7 +3,11 @@ https://leetcode-cn.com/problems/binary-tree-postorder-traversal/
|
||||
|
||||
## 思路
|
||||
|
||||
题号:94,144,145 一起做一下
|
||||
094.二叉树的中序遍历
|
||||
144.二叉树的前序遍历
|
||||
145.二叉树的后序遍历
|
||||
|
||||
建议一起做一下
|
||||
|
||||
## C++代码
|
||||
|
||||
|
Reference in New Issue
Block a user