首页 > 其他 > 详细

[LeetCode]Binary Tree Preorder Traversal

时间:2014-12-29 21:31:41      阅读:259      评论:0      收藏:0      [点我收藏+]

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 binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
	List<Integer> res = new ArrayList<>();
	Stack<TreeNode> stack = new Stack<>();
	public List<Integer> preorderTraversal(TreeNode root) {
		if(root == null) return new ArrayList<Integer>();
		stack.push(root);
		while(!stack.isEmpty()){
			TreeNode tn = stack.pop();
			res.add(tn.val);
			if(tn.right!=null){
				stack.push(tn.right);
			}
			if(tn.left!=null){
				stack.push(tn.left);
			}
		}
		return res;
	}
}




[LeetCode]Binary Tree Preorder Traversal

原文:http://blog.csdn.net/guorudi/article/details/42243019

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!