Umm I have a small question :)
Which do you recommend for fast searching BST or AVL tree?
My answer: It might be the BST because it'll be noticed that in the right subtree all the numbers greater than the root will be there
also for the smaller numbers will be left
so we can search it easily by just knowing the number that we want to search for if it is greater than the root or smaller!
WHAT do you think? Is my answer right?
thanks in advance :)