concept of balanced binary search tree and how to rotate for balancing the tree. balanced binary search tree is a binary search tree that lets the search cost always O(log n) by making it balanced (not skewed).

kenzan8000 のブックマーク 2020/05/08 17:01

<blockquote class="hatena-bookmark-comment"><a class="comment-info" href="https://b.hatena.ne.jp/entry/4685408318992758082/comment/kenzan8000" data-user-id="kenzan8000" data-entry-url="https://b.hatena.ne.jp/entry/s/www.youtube.com/watch?v=q4fnJZr8ztY" data-original-href="https://www.youtube.com/watch?v=q4fnJZr8ztY" data-entry-favicon="https://cdn-ak2.favicon.st-hatena.com/64?url=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3Dq4fnJZr8ztY" data-user-icon="/users/kenzan8000/profile.png">Balanced binary search tree rotations</a><ul class="comment-tag" style="list-style: none; margin: 0px;"><li style="float: left">[<a href="https://b.hatena.ne.jp/q/%22balanced%20binary%20search%20tree%22">balanced binary search tree</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/%22binary%20search%22">binary search</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/%22binary%20tree%22">binary tree</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/algorithm">algorithm</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/%22data%20structure%22">data structure</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/%22computer%20science%22">computer science</a>]</li></ul><br><p style="clear: left"> concept of balanced binary search tree and how to rotate for balancing the tree. balanced binary search tree is a binary search tree that lets the search cost always O(log n) by making it balanced (not skewed).</p><a class="datetime" href="https://b.hatena.ne.jp/kenzan8000/20200508#bookmark-4685408318992758082"><span class="datetime-body">2020/05/08 17:01</span></a></blockquote><script src="https://b.st-hatena.com/js/comment-widget.js" charset="utf-8" async></script>

このブックマークにはスターがありません。
最初のスターをつけてみよう！