https://leetcode.com/problems/binary-tree-preorder-traversal/description/
Given a binary tree, return the preorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3}
,
1 \ 2 / 3
return [1,2,3]
.
Note: Recursive solution is trivial, could you do it iteratively?
package go.jacob.day810;
import java.util.ArrayList;
import java.util.List;
import java.util.Stack;
public class Demo2 {
/*
* 非递归实现先序遍历
* 使用堆栈
*/
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<Integer>();
if (root == null)
return res;
Stack<TreeNode> stack = new Stack<TreeNode>();
TreeNode node = root;
while (!stack.isEmpty() || node != null) {
if (node == null) {
node = stack.pop();
node = node.right;
} else {
stack.push(node);
res.add(node.val);
node = node.left;
}
}
return res;
}
}