datastructures DataStructure related problems solving Find closest in BST - Sample Implementation var tree = new BinarySearchTree(); tree.insert(10); tree.insert(5); tree.insert(2); tree.insert(1); tree.insert(15); tree.insert(13); tree.insert(14); tree.insert(22); tree.searchClosest(tree, 12);