JavaScript-二叉树的前中后排序以及删除

最新推荐文章于 2025-04-10 16:10:39 发布

zLanaDelRey

最新推荐文章于 2025-04-10 16:10:39 发布

阅读量281

点赞数

分类专栏：前端数据结构

本文链接：https://blog.youkuaiyun.com/zLanaDelRey/article/details/82082339

版权

前端同时被 2 个专栏收录

30 篇文章

订阅专栏

数据结构

6 篇文章

订阅专栏

博客围绕JavaScript中二叉树展开，涉及二叉树的前序、中序、后序排序操作，以及删除操作。这些操作在信息技术领域的数据结构处理中具有重要意义，有助于高效地管理和操作二叉树数据。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <meta http-equiv="X-UA-Compatible" content="ie=edge">
    <title>Document</title>
</head>
<body>
    <script>
        function BinaryTree(){
            var Node = function(key){
                this.key = key;
                this.left =null;
                this.right=null;
                }
            var root = null;

            var insertNode = function(node, newNode){
                if(newNode.key <node.key){
                    if(node.left === null){
                        node.left=newNode;
                    }else{
                        insertNode(node.left, newNode);
                    }
                }else{
                    if(node.right===null){
                    node.right = newNode;
                    }
                    else{
                        insertNode(node.right, newNode);
                     }
                }
            }

            this.insert = function(key){
                var newNode = new Node(key);
            if(root === null){
                root = newNode;
            }else{
                insertNode(root,newNode);
                }
            };
            //中序遍历
            var inOrderTaverseNode = function(node, callback){
                if(node!==null){
                    inOrderTaverseNode(node.left, callback);
                    callback(node.key);
                    inOrderTaverseNode(node.right,callback);
                }
            }

            this.insOrderTraverse = function(callback){
                inOrderTaverseNode(root, callback)
            }

            //前序遍历
            var preOrderTraverseNode = function(node, callback){
                if(node !== null){
                    callback(node.key)
                    preOrderTraverseNode(node.left, callback);
                    preOrderTraverseNode(node.right, callback);
                }
            }
            this.preOrderTraverse = function(callback){
                preOrderTraverseNode(root, callback);
            }
            //后序遍历 
           var postOrderTraverseNode = function(node, callback)
           {
               if(node !== null){
                   postOrderTraverseNode(node.left, callback);
                   postOrderTraverseNode(node.right, callback);
                   callback(node.key);
               }

           }     
           this.postOrderTraverse = function(callback){
               postOrderTraverseNode(root, callback);
           } 
           //查找最小值
           var minNode = function(node){
               if(node){
                   while(node&&node.left !== null){
                       node = node.left;
                   }
                   return node.key;
               }
               return null;
           }
           this.min = function(){
               return minNode(root);
           }
           //查找最大值
           var maxNode = function(node){
               if(node){
                   while(node && node.right !== null){
                       node = node.right;
                   }
                   return node.key;
               }
               return null;
           }

           this.max = function(){
               return maxNode(root);
           }

           //查找指定值
           var searchNode = function(node, key){
               if(node === null){
                   return false;
               }
               if(key < node.key){
                   return searchNode(node.left, key);
               }else if(key>node.key){
                   return searchNode(node.right, key);
               }else{
                   return true;
               }
           }
           this.search =function(key){
               return searchNode(root, key);
           }
        var findMinNode =function(node){
            if(node){
                while(node && node.left !== null){
                    node = node.left;
                }
                return node;
            }
            return null;
        }

           var removeNode = function(node, key){
               if(node === null){
                   return null;
               }
               if(key < node.key){
                   node.left = removeNode(node.left, key);
                   return node;
               }else if(key > node.key){
                   node.right = removeNode(node.right, key);
                   return node;
               }else{
                   if(node.left === null && node.right === null){
                       node = null;
                       return node;
                   }
                   if(node.left === null){
                       node = node.right;
                       return node;
                   }else if(node.right === null){
                       node = node.left;
                       return node;

                   }
                   var aux = findMinNode(node.right);
                   node.key = aux.key;
                   node.right = removeNode(node.right, aux.key);
                   return node;
               }
           }
           this.remove = function(key){
               root = removeNode(root, key);
           }
        }
        var nodes = [8, 3, 10, 1, 6, 4, 7, 13];
        var binaryTree = new BinaryTree();
        nodes.forEach(function(key){
            binaryTree.insert(key);
        });

        var callback = function(key){
            console.log(key);
        }
        console.log("min node is:"+binaryTree.min());
        console.log("max node is:"+binaryTree.max());
        binaryTree.postOrderTraverse(callback);   //前中后序遍历

        console.log(binaryTree.search(7)?'key 7 is found':'key 7 is not found');
        console.log(binaryTree.search(5)?'key 5 is found':'key 5 is not found');


        binaryTree.remove(3);
    </script>
</body>
</html>