二叉树的先序遍历
二叉树的中序遍历 | 二叉树的后序遍历 | 二叉树的层序遍历
先对root根节点入栈,然后根节点出栈,将根节点的右儿子先入栈,再将根节点的左儿子入栈。
import java.util.ArrayList;
import java.util.Stack;
public class Solution {
public ArrayList<Integer> preorderTraversal(TreeNode root) {
Stack<TreeNode> stack = new Stack<TreeNode>();
ArrayList<Integer> ans = new ArrayList<Integer>(20);
if (root == null) {
return ans;
}
TreeNode cur = root;
stack.push(cur);
while (!stack.isEmpty()) {
cur = stack.pop();
ans.add(cur.val);
if (cur.right != null) {
stack.push(cur.right);
}
if (cur.left != null) {
stack.push(cur.left);
}
}
return ans;
}
}