【LeetCode】144. Binary Tree Preorder Traversal(Medium)解题报告
题目地址:https://leetcode.com/problems/binary-tree-preorder-traversal/description/
题目描述:
Given a binary tree, return the preorder traversal of its nodes’ values.
For example:
Given binary tree [1,null,2,3],
1
\
2
/
3
return [1,2,3].
求前序遍历
Solution1:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
两种方法:递归和stack
time : O(n)
space : O(n)
*/
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
if(root == null) return res;
helper(res,root);
return res;
}
public static void helper(List<Integer> res,TreeNode root){
if(root == null) return;
res.add(root.val);
helper(res,root.left);
helper(res,root.right);
}
}
Solution2:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
两种方法:递归和stack
time : O(n)
space : O(n)
*/
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
if(root == null) return res;
Stack<TreeNode> stack = new Stack<>();
stack.push(root);
while(!stack.isEmpty()){
TreeNode cur = stack.pop();
//right要放在left之前,栈先入后出
if(cur.right!=null) stack.push(cur.right);
if(cur.left!=null) stack.push(cur.left);
res.add(cur.val);
}
return res;
}
}
Date:2018年3月11日