/O1-CompleteBinaryTree

A Generic Complete Binary Tree implementation , with O(1) Amortized Complexity in Insertion & O(1) Complexity in Removal of last node and Getting the last node.

Primary LanguageCMIT LicenseMIT

Watchers