Home/ Questions/Q 6732613
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-26T10:40:17+00:00

I am a bit confused a term lookup algorithm of avl trees. When I

  • 0

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.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    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).

    • 0