LeetCode算法之141-二叉树的遍历之-前序遍历

二叉树的前序遍历

难度简单610收藏分享切换为英文接收动态反馈

给你二叉树的根节点 root ，返回它节点值的 前序 遍历。

示例 1：

输入：root = [1,null,2,3]
输出：[1,2,3]

示例 2：

输入：root = []
输出：[]

示例 3：

输入：root = [1]
输出：[1]

示例 4：

输入：root = [1,2]
输出：[1,2]

示例 5：

输入：root = [1,null,2]
输出：[1,2]

提示：

• 树中节点数目在范围 [0, 100] 内
• -100 <= Node.val <= 100

F1:递归：每次将当前子树的根节点的值放进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> tree = new ArrayList<Integer>();
        preorder(root,tree);
        return tree;
    }

    public void preorder(TreeNode root,List<Integer> res){
        if(root == null){
         return ;
        }
        res.add(root.val);
        preorder(root.left,res);
        preorder(root.right,res);
    }
}

F2:使用迭代法：

/**
 * 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> res = new ArrayList<Integer>();
        if(root == null){
            return res;
        }
       Deque<TreeNode> stack =  new LinkedList<TreeNode>();//双端队列

       TreeNode node  = root;
       while(!stack.isEmpty() || node!=null){
           while(node != null){
               res.add(node.val);
               stack.push(node);
               node = node.left;
           }
           node = stack.pop();
           node = node.right;
       }
       return res;

    }

}