Mastering data structures in Ruby - AVL Trees
Binary search trees, or BTSs for short, are data structures designed to perform fast lookups on large datasets. The subject of this post is AVL trees, a special kind of self-balancing BST named after its creators Adelson-Velskii and Landis where the height difference between the left and right subtrees (the balance factor) is always in the range (-1..1) giving us O(log2 n) lookups.
Mastering data structures in Ruby - AVL Trees #ruby #rubydeveloper #rubyonrails https://rubyonrails.ba/single/mastering-data-structures-in-ruby-avl-trees
Nezir Zahirovic
Contractor Ruby On Rails (8+ years) / MCPD .Net / C# / Asp.Net / CSS / SQL / (11 years)
