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

kenzan8000 id:kenzan8000

algorithmとbinary treeに関するkenzan8000のブックマーク (17)

Heap Data Structure
kenzan8000 2021/07/24
data structure

algorithm

heap

binary tree
リンク
Advanced Data Structures: Treaps
kenzan8000 2020/05/21
Treap is a data structure that is a combination of binary search tree and heap. e.g. Each node has key and value. Key belongs to BST rule and value belongs to heap rule.

treap

heap

tree

binary tree

search tree

data structure

algorithm

computer science
リンク
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
リンク
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
リンク
Algorithms Explained – minimax and alpha-beta pruning
kenzan8000 2019/10/08
algorithm

minimax

binary tree
リンク
5.9 Construct Binary Tree from Preorder and Postorder traversal | Data Structure Tutorials
kenzan8000 2019/08/28
preoder

postorder

algorithm

data structure

binary tree
リンク
5.8 Construct Binary Tree from Postorder and Inorder with example | Data structures Course
kenzan8000 2019/08/28
postorder

inorder

algorithm

data structure

binary tree
リンク
5.7 Construct Binary Tree from Preorder and Inorder Traversal | Example | Data Structures Tutorials
kenzan8000 2019/08/28
inorder

preoder

data structure

algorithm

binary tree
リンク
Construct Full Binary Tree from given preorder and postorder traversals - GeeksforGeeks
kenzan8000 2019/08/27
Construct a Binary Tree from Postorder and Preorder

data structure

algorithm

preorder

postorder

binary tree
リンク
Construct a Binary Tree from Postorder and Inorder - GeeksforGeeks
kenzan8000 2019/08/27
Construct a Binary Tree from Postorder and Inorder

data structure

algorithm

inorder

postorder

binary tree
リンク
Tree Traversal Techniques - GeeksforGeeks
Tree Traversal techniques include various ways to visit all the nodes of the tree. Unlike linear data structures (Array, Linked List, Queues, Stacks, etc) which have only one logical way to traverse them, trees can be traversed in different ways. In this article, we will discuss all the tree traversal techniques along with their uses. Tree TraversalTree Traversal refers to the process of visiting
kenzan8000 2019/08/26
inorder

postorder

preorder

algorithm

data structure

binary tree
リンク
Construct Tree from given Inorder and Preorder traversals - GeeksforGeeks
kenzan8000 2019/07/03
Construct Tree from given Inorder and Preorder traversals

data structure

algorithm

preorder

inorder

binary tree
リンク
1

お知らせ

もっと読む

公式Twitter

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

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

j次のブックマーク

k前のブックマーク

lあとで読む

eコメント一覧を開く

oページを開く

設定を変更しましたx