5 docs tagged with "data-structure"

A red-black tree is a self-balancing binary search tree that uses color-coded nodes to maintain balance and ensure efficient search, insertion, and deletion operations.

A segment tree is a binary tree data structure that allows answering range queries and updating values in an array in logarithmic time.