---
title: "Binary Tree Preorder Traversal"
author: "KickCode"
date: "2016-02-14T03:10:17Z"
tags: []
categories: ["编程语言"]
slug: "binary-tree-preorder-traversal"
draft: false
lastmod: "2016-02-14T03:10:17Z"
id: 2276312
url: "https://kickcode.iteye.com/blog/2276312"
---

Given a binary tree, return the preorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},
   1
    \
     2
    /
   3
return .

前序遍历一棵树，我们可以用递归，也可以借助堆栈用迭代来解决，因为前序遍历的顺序是根-左-右，因此我们压栈的时候顺序为根-右-左。下面是两个方法的代码：
递归：

```java

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList<Integer>();
        if(root == null) return list;
        getPreorder(root, list);
        return list;
    }
    public void getPreorder(TreeNode root, List<Integer> list) {
        if(root == null) return;
        list.add(root.val);
        getPreorder(root.left, list);
        getPreorder(root.right, list);
    }
}

```


迭代：

```java

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList<Integer>();
        Stack<TreeNode> stack = new Stack<TreeNode>();
        if(root == null) return list;
        stack.add(root);
        while(!stack.isEmpty()) {
            TreeNode node = stack.pop();
            list.add(node.val);
            if(node.right != null) {
                stack.push(node.right);
            }
            if(node.left != null) {
                stack.push(node.left);
            }
        }
        return list;
    }
}

```