『23-Tree Intuition and Definition』へのコメント

2-3 tree is a balanced search tree by letting every node have 1 or 2 keys and 0-3 children.

kenzan8000 のブックマーク 2020/05/12 13:53

<blockquote class="hatena-bookmark-comment"><a class="comment-info" href="https://b.hatena.ne.jp/entry/4685587797211770946/comment/kenzan8000" data-user-id="kenzan8000" data-entry-url="https://b.hatena.ne.jp/entry/s/www.youtube.com/watch?v=C3SsdUqasD4" data-original-href="https://www.youtube.com/watch?v=C3SsdUqasD4" data-entry-favicon="https://cdn-ak2.favicon.st-hatena.com/64?url=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3DC3SsdUqasD4" data-user-icon="/users/kenzan8000/profile.png">23-Tree Intuition and Definition</a><ul class="comment-tag" style="list-style: none; margin: 0px;"><li style="float: left">[<a href="https://b.hatena.ne.jp/q/%222-3%20tree%22">2-3 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"> 2-3 tree is a balanced search tree by letting every node have 1 or 2 keys and 0-3 children.</p><a class="datetime" href="https://b.hatena.ne.jp/kenzan8000/20200512#bookmark-4685587797211770946"><span class="datetime-body">2020/05/12 13:53</span></a></blockquote><script src="https://b.st-hatena.com/js/comment-widget.js" charset="utf-8" async></script>

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