非递归实现二叉树的先序遍历
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
import java.util.*;
public class Solution {
ArrayList<Integer> list = new ArrayList<Integer>();
public ArrayList<Integer> preorderTraversal(TreeNode root) {
if (root == null) {
return list;
}
Stack<TreeNode> stack = new Stack<TreeNode>();
//根节点进栈
stack.push(root);
while (!stack.isEmpty()) {
//根节点进数组
TreeNode p = stack.pop();
list.add(p.val);
//因为先序遍历的顺序是根左右,所以右节点先进栈
if (p.right != null) {
stack.push(p.right);
}
//左节点进栈
if (p.left != null) {
stack.push(p.left);
}
}
return list;
}
}
顺便给出递归遍历
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
import java.util.*;
public class Solution {
ArrayList<Integer> list = new ArrayList<Integer>();
public ArrayList<Integer> preorderTraversal(TreeNode root) {
if (root == null) {
return list;
}
list.add(root.val);
if (root.left != null) {
preorderTraversal(root.left);
}
if (root.right != null) {
preorderTraversal(root.right);
}
return list;
}
}