代码随想录day14 Java版二叉树

最新推荐文章于 2024-07-22 20:42:52 发布

qq_58958592

最新推荐文章于 2024-07-22 20:42:52 发布

阅读量333

点赞数 8

文章标签：数据结构

本文链接：https://blog.csdn.net/qq_58958592/article/details/136485354

版权

144 二叉树的前序遍历

/**
 * 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<>();
        Traversal(root, list);
        return list;
    }
    public void Traversal(TreeNode t, List list) {
        if (t == null) return ;
        list.add(t.val);
        Traversal(t.left, list);
        Traversal(t.right, list);
    }
}

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        Stack<TreeNode> stack = new Stack<>();
        List<Integer> list = new ArrayList<>();
        if (root == null) return list;
        stack.add(root);
        while (!stack.isEmpty()) {
            TreeNode temp = stack.pop();
            if (temp.right != null) stack.add(temp.right);
            if (temp.left != null) stack.add(temp.left);
            list.add(temp.val);
        }
        return list;
    }
}

力扣145 二叉树的后序遍历

class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> result = new ArrayList<>();
        tra(root, result);
        return result;
    }
    public void tra (TreeNode root, List<Integer> result) {
        if (root == null) return;
        tra(root.left, result);
        tra(root.right, result);
        result.add(root.val);
    }
}

class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        ArrayList<Integer> res = new ArrayList<>();
        Stack<TreeNode> stack = new Stack<>();
        if (root == null) return res;
        stack.add(root);
        while (!stack.isEmpty()) {
            TreeNode temp = stack.pop();
            res.add(temp.val);
            if (temp.left != null) stack.add(temp.left);
            if (temp.right != null) stack.add(temp.right);
        }
        Collections.reverse(res);
        return res;
    }
}

力扣94 二叉树的中序遍历

class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> result = new ArrayList<>();
        tra(root, result);
        return result;
    }
    public void tra (TreeNode root, List<Integer> result) {
        if (root == null) return;
        tra(root.left, result);
        result.add(root.val);
        tra(root.right, result);
    }
}

class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        TreeNode cur = root;
        Stack<TreeNode> stack = new Stack<>();
        while (cur != null || !stack.isEmpty()) {
            if (cur != null) {
                stack.add(cur);
                cur = cur.left;
            } else {
                cur = stack.pop();
                res.add(cur.val);
                cur = cur.right;
            }
        }
        return res;
    }
}