赤あか黒くろ木ぎ

noun

red-black tree

A self-balancing binary search tree used in computer science. The term is technical and domain-specific.

• 赤あか黒くろ木ぎは、挿そう入にゅうや削さく除じょの後あとでもバランスを保たもつデータ構こう造ぞうです。

  A red-black tree is a data structure that maintains balance even after insertions and deletions.