代码高亮网站:
http://word.wd1x.com/
- 二叉树的前序遍历
给你二叉树的根节点 root ,返回它节点值的 前序 遍历。
示例 1:
输入:root = [1,null,2,3]
输出:[1,2,3]
示例 2:
输入:root = []
输出:[]
示例 3:
输入:root = [1]
输出:[1]
示例 4:
输入:root = [1,2]
输出:[1,2]
示例 5:
输入:root = [1,null,2]
输出:[1,2]
提示:
树中节点数目在范围 [0, 100] 内
-100 <= Node.val <= 100
进阶:递归算法很简单,你可以通过迭代算法完成吗?
递归
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> ans=new ArrayList<Integer>();
if(root==null)return ans;
ans.add(root.val);
ans.addAll(preorderTraversal(root.left));
ans.addAll(preorderTraversal(root.right));
return ans;
}
}
迭代
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> ans=new ArrayList<Integer>();
Stack<TreeNode> stk=new Stack<TreeNode>();
while(root!=null||!stk.isEmpty()){
while(root!=null){
ans.add(root.val);
stk.push(root);
root=root.left;
}
root=stk.pop();
root=root.right;
}
return ans;
}
}
Morris
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<Integer>();
while (root != null) {
if (root.left != null) {
TreeNode pre = root.left;
while (pre.right != null && pre.right != root) pre = pre.right;
if (pre.right == null) {
//第一次找到左子树的最右节点,先将自己加入ans,再挂上,相当于标记,然后进入左子树
res.add(root.val);
pre.right = root;
root = root.left;
} else {
//第二次找到左子树的最右节点,此时本节点和左子树都访问完了,直接进入右子树
//pre.right = null;//把挂上去的再取下去,恢复树的结构,但是对答案不影响
root = root.right;
}
} else {
//没有左子树,当然就不要先找了,直接将自己加入答案,然后进入右子树
res.add(root.val);
root = root.right;
}
}
return res;
}
}