Last Updated
：2025/11/25
red-black tree
（ plural ）
Quizzes for review
(computing) A type of self-balancing binary search tree, typically used to implement associative arrays.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
red-black tree
To guarantee logarithmic-time operations, the library implements its associative array using a red-black tree under the hood.
See correct answer
To guarantee logarithmic-time operations, the library implements its associative array using a red-black tree under the hood.
音声機能が動作しない場合はこちらをご確認ください
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
