BinarySearchTree: wrong size() in example

[art-in]

Original question

let tree = new BinarySearchTree
tree.add(1, 2, 3, 4)
tree.add(5)
tree.has(2)                           // true
tree.has(5)                           // true
tree.remove(3)                        // undefined
tree.size()                           // 3

Should be tree.size() // 4 (total number of nodes)

Or maybe tree.depth() // 3 (highest distance from root, in case it is not self-balancing BST)

[bcherny]

Typo - good catch @artin-phares!