{"version":"1.0","type":"link","title":"Self-balancing binary search tree - Newikis","description":"In computer science, a self-balancing binary search tree (BST) is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions. These operations when designed for a self-balancing binary…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/a/a9/Unbalanced_binary_tree.svg/1280px-Unbalanced_binary_tree.svg.png","thumbnail_width":1280,"thumbnail_height":1280}