给定一个二叉树,返回它的先序遍历。
示例:
输入: [1,null,2,3]
1
\
2
/
3
输出: [1,2,3]
树节点类
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
非递归先序遍历
public List<Integer> preorderTraversal(TreeNode root) {
Stack<TreeNode> s = new Stack<>();
List<Integer> L = new ArrayList<>();
TreeNode cur = root;
while(cur != null || s.empty() == false){
while(cur != null){
L.add(cur.val);
s.push(cur);
cur = cur.left;
}
if(s.empty() == false){
cur = s.pop();
cur = cur.right;
}