Jesse Russell Ronald Cohn
Нет в продаже
Продать эту книгу
High Quality Content by WIKIPEDIA articles! A red–black tree is a type of self-balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays.