книги Наука, техника, медицина Гуманитарные науки Философия Прикладная философия

AVL tree

Код 3255096

  • ISBN: 978-5-5142-3070-9

Нет в продаже

Аннотация к книге "AVL tree"

High Quality Content by WIKIPEDIA articles! In computer science, an AVL tree is a self-balancing binary search tree, and it was the first such data structure to be invented. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. Lookup, insertion, and deletion all take O(log n) time in both the average and worst cases, where n is the number of nodes in the tree prior to the operation. Insertions and deletions may require the tree to be rebalanced by one or more tree rotations.

Оставить комментарий

Оцените книгу:

ISBN: 978-5-5142-3070-9

Книга находится в категориях

ГОСТы, стандарты Экономика Менеджмент (управление)

Вместе с этой книгой покупают