《leetCode》：Binary Tree Preorder Traversal

题目

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?

思路一：用递归

如果选择用递归来做，则就比较简单了。
实现代码如下：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */
void preorderTraversalHelper(struct TreeNode* root,int *arr,int* returnSize){
    if(root==NULL){
        return ;
    }
    arr[*returnSize]=root->val;
    (*returnSize)++;
    preorderTraversalHelper(root->left,arr,returnSize);
    preorderTraversalHelper(root->right,arr,returnSize);    
}
#define N 1000
int* preorderTraversal(struct TreeNode* root, int* returnSize) {
    int *res=(int *)malloc(N*sizeof(int));
    if(res==NULL){
        exit(EXIT_FAILURE);
    }
    *returnSize=0;
    preorderTraversalHelper(root,res,returnSize);
    return res;
}

思路二：迭代

既然要用到迭代思想，因此，需要借助一个栈来完成，先将右孩子入栈，然后将左孩子入栈。这样就会先将左孩子出栈。根据这样的思想就可以完成先序遍历。

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