ziyang_li/LeetCode
1
0
Fork 0
mirror of https://github.com/ShusenTang/LeetCode.git synced 2024-09-02 14:20:01 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update 144. Binary Tree Preorder Traversal.md

Browse Source
This commit is contained in:
ShusenTang 2020-06-25 18:53:21 +08:00 committed by GitHub
parent f5d96222a0
commit c1fb25f6d2
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
solutions/144. Binary Tree Preorder Traversal.md
View File

@ -1,11 +1,11 @@
# [144. Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/)
# 思路
要求进行二叉树的前序遍历, 属于务必掌握的基本题目.
要求进行二叉树的前序遍历, 属于务必掌握的基本题目。
## 思路一 递归
最简单的当然就是递归遍历了, 先遍历当前节点, 再递归遍历左子树, 再递归遍历右子树. 递归出口就是当前节点为空.
## 思路二 迭代
稍微难一点的就是迭代遍历. 这里一共有三种写法, 注意领会相互区别.
稍微难一点的就是迭代遍历. 这里一共有三种写法, 注意领会相互区别，关键点就是**右孩子比左孩子先入栈**。
# C++
## 思路一 递归