Introduction - If you have any usage issues, please Google them yourself
Binary Search tree: delete elements larger or smaller than the specified element, delete an element within a range; delete, insert, find function in non recursion to reduce running time; find the ith large element