JavaScript实现二叉树

最新推荐文章于 2022-03-04 14:27:37 发布

fsrloveless

最新推荐文章于 2022-03-04 14:27:37 发布

阅读量211

点赞数

分类专栏： web前端文章标签：二叉树 JavaScript

本文链接：https://blog.csdn.net/fsrloveless/article/details/80186381

版权

web前端专栏收录该内容

4 篇文章 0 订阅

订阅专栏

<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title>二叉树</title>
</head>
<body>
<script type="text/javascript">
//定义二叉树
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.right===null) {
node.right=newnode;
}
else insertNode(node.right, newnode);
} else {
if (node.left===null) {
node.left=newnode;
}
else insertNode(node.left, newnode);
}
}
//插入值
this.insert=function(key) {
var newnode=new Node(key);
if (root===null) {
root=newnode;
} else {
insertNode(root, newnode);
}
}

//中序遍历
var inOrderTraverseNode=function(node, callback) {
if (node!==null) {
inOrderTraverseNode(node.left, callback);
callback(node.key);
inOrderTraverseNode(node.right, callback);
}
}
this.inOrdertraverse=function(callback) {
inOrderTraverseNode(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;
}
}

this.min=function(){
return minNode(root);
}

//查找最大值
var maxNode=function(node) {
if (node) {
while (node && node.right!==null) {
node=node.right;
}
return node.key;
}
}

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

}
//定义原始数据数组
var nodes=[18, 8, 45, 34, 27, 6, 23, 17];
var binaryTree= new BinaryTree();
nodes.forEach(function(key) {
binaryTree.insert(key);
})
var callback=function(key) {
console.log(key);
}
binaryTree.inOrdertraverse(callback);
binaryTree.preOrderTraverse(callback);
binaryTree.postOrderTraverse(callback);
console.log("min node is: "+ binaryTree.min());
console.log("max node is: "+ binaryTree.max());
console.log(binaryTree.search(36)? "key 36 is found" : "key 36 is not found");
</script>

</body>
</html>