B-Tree

Question 1

B-tree adalah?

Answer 1

generalisasi dari 2-3 tree dimana setiap node dalam menampung sampai m data. Cocok untuk data yang besar. biasanya digunakan dalam database

Question 2

B-tree properties?

Answer 2

1. every node has at most m children
2. every node (except root) has at least m/2 children.
3. the root has at least 2 children if it is not a leaf.
4. a non leaf node with k children contain k-1 keys
5. all data are kept in sorted order
6. all leaves are at the same level.