/***@title二叉排序树*/classBinaryTreeNode{constructor(key,value){this.key=key;this.value=值；this.left=null;this.right=null;this.parent=null;}}classBinarySearchTree{constructor(){this.root=null;}staticcreateNode(key,value){returnnewBinaryTreeNode(key,value);}insert(node){//如果没有根节点，直接插入根节点if(!this.root){this.root=node;返回;}让父母=this.root;while(true){if(node.key
