二叉树前中后

最新推荐文章于 2022-12-14 21:59:57 发布

优价实习

最新推荐文章于 2022-12-14 21:59:57 发布

阅读量99

点赞数

分类专栏：算法leecode 文章标签： js

本文链接：https://blog.csdn.net/weixin_44828588/article/details/115003912

版权

算法leecode 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
</head>

<body>
    <script>
        /*
         * function TreeNode(x) {
         *   this.val = x;
         *   this.left = null;
         *   this.right = null;
         * }
         */

        /**
         * 
         * @param root TreeNode类 the root of binary tree
         * @return int整型二维数组
         */
        function threeOrders(root) {
            // write code here
            let preArray = [],
                middleArray = [],
                postArray = [];

            function preOrder(root) {
                if (root) {
                    preArray.push(root.val)
                    preOrder(root.left)
                    preOrder(root.right)
                }
            }

            function inOrder(root) {
                if (root) {
                    inOrder(root.left)
                    middleArray.push(root.val)
                    inOrder(root.right)
                }
            }

            function postOrder(root) {
                if (root) {
                    postOrder(root.left)
                    postOrder(root.right)
                    postArray.push(root.val)
                }
            }
            preOrder(root)
            inOrder(root)
            postOrder(root)
            return [preArray, middleArray, postArray]
        }
        module.exports = {
            threeOrders: threeOrders
        };
        //———————————————————————————————迭代法———————————————————————————————————————
        /*
         * function TreeNode(x) {
         *   this.val = x;
         *   this.left = null;
         *   this.right = null;
         * }
         */

        /**
         * 
         * @param root TreeNode类 the root of binary tree
         * @return int整型二维数组
         */
        function threeOrders(root) {
            // write code here
            //if(!root) return 0
            // return 1+Math.max(MaxDep(root.left),(MaxDep(root.rigth))
            let preArray = [],
                midArry = [],
                posArry = []
                //    1.前序遍历、迭代法

            function preorder(root) {
                const res = []
                if (root == null) return res
                const stack = []
                stack.push(root)
                    // preArray=root
                while (stack.length > 0) {
                    const current = stack.pop()
                    res.push(current.val)
                    if (current.right !== null) stack.push(current.right)
                    if (current.left !== null) stack.push(current.left)

                }
                preArray = res
                    // 
            }

            function midorder(root) {
                const res = []
                if (root == null) return res
                const stack = []
                stack.push(root)
                while (stack.length > 0) {
                    const current = stack.pop()

                    if (current.right !== null) stack.push(current.right)
                    res.push(current.val)
                    if (current.left !== null) stack.push(current.left)

                }
                midArry = res
                    // 
            }

            function postorder(root) {
                const res = []
                if (root == null) return res
                const stack = []
                stack.push(root)
                while (stack.length > 0) {
                    const current = stack.pop()

                    if (current.right !== null) stack.push(current.right)
                    res.push(current.val)
                    if (current.left !== null) stack.push(current.left)

                }
                posArry = res
                    // 
            }
            preorder()
            midorder()
            postorder()
            return [preArray, midArry, posArry]

        }
        module.exports = {
            threeOrders: threeOrders
        };
    </script>
</body>

</html>

优价实习

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
打赏
0
评论
二叉树前中后

<!DOCTYPE html><html lang="en"><head> <meta charset="UTF-8"> <meta http-equiv="X-UA-Compatible" content="IE=edge"> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <title>D.
复制链接

扫一扫