### Wiktionary

B-tree(Noun)

An indexed data structure suitable for storage of a large number of items in a balanced fashion, with very few disk hits required for locating the correct record block.

### Freebase

B-tree

In computer science, a B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree is a generalization of a binary search tree in that a node can have more than two children. Unlike self-balancing binary search trees, the B-tree is optimized for systems that read and write large blocks of data. It is commonly used in databases and filesystems.

### Anagrams for b-tree »

beret

### How to pronounce b-tree?

- AlexUS EnglishDanielBritishKarenAustralianVeenaIndian

### How to say b-tree in sign language?

### Numerology

Chaldean Numerology

The numerical value of b-tree in Chaldean Numerology is:

**9**Pythagorean Numerology

The numerical value of b-tree in Pythagorean Numerology is:

**5**

### Images & Illustrations of b-tree

© Definitions.net