Add removeTreeNode methods to AvlTree and BinarySearchTree

[masx200]

Add removeTreeNode methods to AvlTree and BinarySearchTree

binary-search-tree/src/avlTree.d.ts

Line 4 in bcc16da

export class AvlTree<T> extends BinarySearchTree<T> {

https://github.com/datastructures-js/binary-search-tree/blob/master/src/avlTree.d.ts#L4

denoland/std#3055

A node can be removed from a binary tree with O(1) time complexity using the removeTreeNode method.

https://cplusplus.com/reference/set/set/erase/

[eyas-ranjous]

@masx200

After reviewing this feature, there is an important finding here about removeNode. I do not see how it can be a perfect O(1). because your analysis did not take in consideration the worse case scenario of when the to-be-removed node, has both a left and right children. meaning, we have to find the node with min value in the right sub-tree, this operation itself is an O(log(n)) in the worst case, the method removeNode can still be added though, I like it, but you are aware about this case, what's you take on it?

https://github.com/datastructures-js/binary-search-tree/blob/master/src/binarySearchTree.js#L306-L309

[masx200]

For example, when I want to traverse the binary search tree from large to small and delete the largest nodes, I should first do reverse mid-order traversal, and then delete the nodes directly to speed up.

[eyas-ranjous]

right, but you agree that worst case scenario of the function is O(log(n)) correct?