Home > Term: red-black tree
red-black tree
A nearly-balanced tree that uses an extra bit per node to maintain balance. No leaf is more than twice as far from the root as any other. Formal Definition: A red-black tree with n internal nodes has height at most 2log2(n+1).
- Jenis Kata: noun
- Industri / Domain: Sains komputer
- Kategori: Algorithms & data structures
- Government Agency: NIST
0
Penulis
- GeorgeV
- 100% positive feedback