이진탐색,binary_search in RRWiki

aka binary_search_algorithm

is_a 탐색,search 알고리듬,algorithm 탐색알고리듬,search_algorithm

Sub:
이진탐색트리,binary_search_tree (BST)
이진탐색트리,binary_search_tree,BST
{
binary search tree

Rel
이진로그,binary_logarithm =이진로그,binary_logarithm =,binary_logarithm 이진로그,binary_logarithm
{
binary logarithm

밑이 2인 로그.

MKL
둘,two
Opp. 2의거듭제곱 (pagename?)... {
https://ko.wikipedia.org/wiki/2의_거듭제곱
https://simple.wikipedia.org/wiki/Power_of_two
https://en.wikipedia.org/wiki/Power_of_two
https://ja.wikipedia.org/wiki/2の冪 }

Twin

https://ko.wikipedia.org/wiki/이진_로그
https://en.wikipedia.org/wiki/Binary_logarithm
https://ja.wikipedia.org/wiki/二進対数
...
이진로그

이진로그

Up: 로그,logarithm or 로가리듬,logarithm ??

로그,log
Up: 이진,binary 바이너리,binary
}

Twin:
https://everything2.com/title/binary search tree
https://en.wikipedia.org/wiki/Binary_search_tree

2023-11-16 첫문단 "In CS, a binary search tree (BST), also called an ordered binary tree or sorted binary tree,
is a rooted binary tree data structure // rooted_tree AND binary_tree ... https://en.wikipedia.org/wiki/Rooted_tree https://en.wikipedia.org/wiki/Binary_tree
with the key of each internal node being

greater than all the keys in the respective node's left subtree
and
less than the ones in its right subtree.

The time complexity of operations on the binary search tree is linear with respect to the height of the tree."

https://ja.wikipedia.org/wiki/二分探索木

이분탐색목

...
"binary search tree"

binary search tree

Up: 이진탐색,binary_search 탐색트리,search_tree 이진트리,binary_tree

}

Twins:
https://everything2.com/title/binary search
https://ko.wikipedia.org/wiki/이진_검색_알고리즘
https://simple.wikipedia.org/wiki/Binary_search
https://en.wikipedia.org/wiki/Binary_search_algorithm

Up: 이진,binary 바이너리,binary
Up: 탐색,search