LeetCode144.二叉树的前序遍历

题目来源：

https://leetcode-cn.com/problems/binary-tree-preorder-traversal/

题目描述：

代码如下：

解法一（递归）：

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

	private void preorderTraversal(TreeNode root, List<Integer> list) {
		if (root != null) {
			list.add(root.val);
			preorderTraversal(root.left, list);
			preorderTraversal(root.right, list);
		}
	}
}

解法二（迭代）：

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