Feature request: implement an iterative variant of binary search tree

[andy0130tw]

As requested in #60, the current implementation is based on recursion over both children of a tree node. If the tree is too deep, some operation may exceed the recursion depth limit imposed by JavaScript engines. While most typical use cases are unlikely to hit this limitation, providing an alternative that relies solely on iterative operations would improve robustness and efficiency.