Hi,
In my assignment , I am supposed to write a
java code for binary search tree and do millions of insertions and deletions of records(integer/string/float etc) in it. After every insert/delete operation , the program should print the height of the tree.
This is part is taking time and takes more than 30 minutes to end the program running. Is there and better and optimized way that takes less time to print height of tree.