I am a bit confused a term "lookup algorithm of avl trees". When I have searched this in google, I see so many website with related about b-tree not avl tree.
So, Is b-tree algorithm equal lookup algorithm of avl tree ? If not, what is "lookup algorithm of avl tree" ? Moreover, what is the meaning of "lookup algorithm"? Please give me a link, of course if possible.
b-tree is a data structure - a generalized binary tree.
A lookup algorithm is an algorithm used to lookup values in the data structure. It is how you decide to find items in the data structure.
An avl tree is a type of b-tree (in the abstract).