[B! binary search] kenzan8000のブックマーク

kenzan8000 id:kenzan8000

binary searchに関するkenzan8000のブックマーク (9)

K-d Tree in Python #3 — Finale
kenzan8000 2020/05/14
k-d tree is a binary search tree that represents the node value as k-dimensional coordinates, and how the left and right branches go depends on the layer of tree (e.g. 1: x, 2: y, 3: z, 4: x, ...). This data structure is typically used for nearest neighbor algorithm.

k-d tree

data structure

algorithm

computer science

binary tree

binary search
リンク
B-Tree Tutorial - An Introduction to B-Trees
kenzan8000 2020/05/12
b-tree (order m) is a balanced search tree that every node has most m children and a non-leaf node with k children contains k-1 keys in the node (can have branch left edge and right edge and positions between the keys. represents keyA < childKeys < keyB). this is typically used for relational db.

b-tree

binary search

binary tee

data structure

algorithm

db

computer science
リンク
23-Tree Intuition and Definition
kenzan8000 2020/05/12
2-3 tree is a balanced search tree by letting every node have 1 or 2 keys and 0-3 children.

2-3 tree

binary search

binary tree

algorithm

data structure

computer science
リンク
Red-Black Trees - Data Structures
kenzan8000 2020/05/09
red-black tree is a binary search tree that is balanced by coloring nodes red or black by some rules. (insertion and deletion video links are in the description below the video.)

red black tree

balanced binary search tree

binary search

binary tree

data structure

algorithm

computer science
リンク
Splay Tree Introduction
kenzan8000 2020/05/09
splay tree is a binary search tree that lets the root always be a target of the search so it enables O(1) for accessing the data. this is often used for cache algorithm. shape of the tree is kept by rotation depending on zig-zag, zig-zig, and zig pattern.

splay tree

binary tree

binary search

data structure

algorithm

computer science
リンク
AVL tree removals
kenzan8000 2020/05/08
avl tree

balanced binary search tree

binary search

binary tree

data structure

algorithm

computer science
リンク
Balanced binary search tree rotations
kenzan8000 2020/05/08
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).

balanced binary search tree

binary search

binary tree

algorithm

data structure

computer science
リンク
Cache Oblivious Search
kenzan8000 2020/05/05
van Emde Boas Trees is a data structure that divides a binary search tree into multiple sub trees for making the times of seek less. (You don't have to visit every node from root like binary search tree. You can just seek root of the sub trees first.)

van Emde Boas Trees

data structure

algorithm

tree

binary search

binary tree

computer science
リンク
Binary Search - Data Structure and Algorithm Tutorials - GeeksforGeeks
CoursesDSA to DevelopmentFor Working ProfessionalsData Structure & Algorithm Classes (Live)System Design (Live)JAVA Backend Development(Live)DevOps(Live)Data Structures & Algorithms in PythonFor StudentsInterview Preparation CourseGATE CS & IT 2024Data Science (Live)Data Structure & Algorithm-Self Paced(C++/JAVA)Master Competitive Programming(Live)Full Stack Development with React & Node JS(Live)F
kenzan8000 2019/07/14
algorithm

data structure

binary search
リンク
1

お知らせ

もっと読む

公式Twitter

@HatenaBookmark
リリース、障害情報などのサービスのお知らせ
@hatebu
最新の人気エントリーの配信

キーボードショートカット一覧

j次のブックマーク

k前のブックマーク

lあとで読む

eコメント一覧を開く

oページを開く

設定を変更しましたx