Answer:
B-trees are search trees that provide an ordered key-value store with excellent performance characteristics. In principle, each node maintains a sorted array of its own elements, and another array for its children.
| Previous Question | Next Question |
| Do you know the difference between copy and retain? | Tell us the difference between not-running, inactive, active, background and suspended execution states? |