@ -7,7 +7,7 @@
const Tree = require("../include/TreeNode");
const { printTree } = require("../include/PrintUtil");
/* 二叉搜索树 */
var root;
function BinarySearchTree(nums) {
@ -143,4 +143,4 @@ console.log("\n删除结点 2 后,二叉树为\n");
printTree(getRoot());
remove(4);
console.log("\n删除结点 4 后,二叉树为\n");