JAVA中树的相关代码

最新推荐文章于 2024-09-14 18:46:05 发布

zHeisenberg

最新推荐文章于 2024-09-14 18:46:05 发布

阅读量133

点赞数 3

文章标签： java 开发语言

本文链接：https://blog.csdn.net/weixin_42909220/article/details/138498032

版权

本文介绍了如何使用Java编程实现二叉树的前序、中序和后序遍历，通过递归方法，并提供了一个测试用例来验证遍历结果。

摘要由CSDN通过智能技术生成

二叉树的leetcode刷题
节点定义

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;
    }
}

// 前序遍历·递归·LC144_二叉树的前序遍历

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> result = new ArrayList<Integer>();
        preorder(root, result);
        return result;
    }

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

// 中序遍历·递归·LC94_二叉树的中序遍历

class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        inorder(root, res);
        return res;
    }

    void inorder(TreeNode root, List<Integer> list) {
        if (root == null) {
            return;
        }
        inorder(root.left, list);
        list.add(root.val);             // 注意这一句
        inorder(root.right, list);
    }
}

// 后序遍历·递归·LC145_二叉树的后序遍历

class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        postorder(root, res);
        return res;
    }

    void postorder(TreeNode root, List<Integer> list) {
        if (root == null) {
            return;
        }
        postorder(root.left, list);
        postorder(root.right, list);
        list.add(root.val);             // 注意这一句
    }
}

测试方法：

public class TestSolution {
    public static void main(String[] args) {
        // 创建二叉树节点
        TreeNode root = new TreeNode(1);
        root.left = new TreeNode(2);
        root.right = new TreeNode(3);
        root.left.left = new TreeNode(4);
        root.left.right = new TreeNode(5);
        root.right.left = new TreeNode(6);
        root.right.right = new TreeNode(7);

        // 实例化Solution类
        Solution solution = new Solution();

        // 调用preorderTraversal方法并获取结果
        List<Integer> result = solution.preorderTraversal(root);

        // 打印结果
        System.out.println("Preorder traversal output: " + result);

        // 预期输出: [1, 2, 4, 5, 3, 6, 7]
        // 创建预期结果列表
        List<Integer> expected = Arrays.asList(1, 2, 4, 5, 3, 6, 7);

        // 验证结果与预期是否一致
        if (result.equals(expected)) {
            System.out.println("Test passed!");
        } else {
            System.out.println("Test failed. Expected: " + expected + ", but got: " + result);
        }
    }
}