function Binary(){
let 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;
}其他{
insertNode(node.right,newNode);
}
}
}
this.insert =函数(密钥){
VAR节点=新节点(键);
if(root == null){
root = node
} else {
insertNode(root,newNode)
}
}
}
var nodes = [8,3,10,1,6,14,4,7,13];
var biary = new Binary();
nodes.forEach(function(){
biary.insert(node [i])
})
js之二叉树
最新推荐文章于 2024-06-12 16:23:50 发布