题目描述:
给定一个二叉树,返回它的 前序 遍历。
例子:
输入: [1,null,2,3]
1
\
2
/
3
输出: [1,2,3]
进阶: 递归算法很简单,你可以通过迭代算法完成吗?
思路:
1.递归
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
private List<Integer> list = new ArrayList() ;
public List<Integer> preorderTraversal(TreeNode root) {
if(root == null){
return new ArrayList() ;
}
list.add(root.val) ;
if(root.left != null){
preorderTraversal(root.left);
}
if(root.right != null){
preorderTraversal(root.right);
}
return list ;
}
}
2.迭代
使用栈,没存入一个节点的值到list集合中,就将这个节点入栈,并且向左遍历,直到没有左节点。这时就从栈中取出一个节点(由于栈有先进后出的特点,所以取出的一定是当前左节点的父节点),得到取出节点的右节点。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList() ;
if(root == null){
return list ;
}
Stack<TreeNode> stack = new Stack<TreeNode>();
TreeNode node = root ;
while(!stack.isEmpty() || node != null){
while(node != null){
list.add(node.val);
stack.push(node);
node = node.left ;
}
node = stack.pop() ;
node = node.right ;
}
return list ;
}
}