درخت بی
Sign in to saveAlso known as B tree, balanced multiway tree
In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing nodes to have more than two children.
Key facts
- Data structure amortized.name
- B-tree
- Data structure amortized.type
- Tree (data structure)
- Data structure amortized.invented_by
- Rudolf Bayer, Edward M. McCreight
- Data structure amortized.invented_year
- 1970
- Data structure amortized.space_avg
- O(n)
- Data structure amortized.search_avg
- O(\log n)
- Data structure amortized.search_worst
- O(\log n)
- Data structure amortized.insert_avg
- O(\log n)
- Data structure amortized.insert_worst
- O(\log n)
- Data structure amortized.delete_avg
- O(\log n)
- Data structure amortized.delete_worst
- O(\log n)
via Wikipedia infobox
Wikidata facts
- Instance of
- data structure
- Subclass of
- data structure
- Image
- B-tree.svg
Show 9 more facts
- uses
- tree
- Commons category
- B-Trees
- topic's main category
- Category:B-tree
- Stack Exchange tag
- stackoverflow.com/tags/b-tree
- time of discovery or invention
- 1972-00-00
- discoverer or inventor
- Edward M. McCreight
- studied by
- algorithmics
- different from
- binary tree
- maintained by WikiProject
- WikiProject Mathematics
Sources (2)
via Wikidata · CC0