• 트리,tree . . . . 21 matches
       [[탐색트리,search_tree]]
       [[search_tree]] =,search_tree =,search_tree . search_tree
       WtEn:search_tree ?
       Srch:search_tree
       이진탐색트리 [[binary_search_tree]] =,binary_search_tree =,binary_search_tree . binary_search_tree (BST) =,BST .
       self-balancing_binary_search_tree
       https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree
       [[randomized_binary_search_tree]] =,randomized_binary_search_tree . randomized_binary_search_tree
        "In computer science, the '''treap and the randomized binary search tree''' are two closely related forms of binary_search_tree data structures that maintain a dynamic set of ordered keys and allow binary searches among the keys.
       [[WpEn:Binary_search_tree]]
       = https://en.wikipedia.org/wiki/Binary_search_tree
       WpEn:Search_tree
        = https://en.wikipedia.org/wiki/Search_tree
• 탐색,search . . . . 16 matches
       [[탐색트리,search_tree]] =탐색트리,search_tree =,search_tree .
       Srch:search_tree
       WtEn:search_tree
       https://en.wikipedia.org/wiki/Search_tree
       [[이진탐색트리,binary_search_tree]] (BST)
       =이진탐색트리,binary_search_tree =,binary_search_tree ==,BST .
       Srch:binary_search_tree
       Up: [[이진트리,binary_tree]] [[탐색트리,search_tree]]
       [[ternary_search_tree]] =,ternary_search_tree . ternary_search_tree
       WpEn:Ternary_search_tree
        = https://en.wikipedia.org/wiki/Ternary_search_tree
• 균형,balance . . . . 4 matches
        [[self-balancing_binary_search_tree]]
        [[WpEn:Self-balancing_binary_search_tree]] = https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree
        curr see https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree 두번째문장 "For height-balanced binary trees,"...
• 바이너리,binary . . . . 4 matches
       이진탐색트리 binary_search_tree // TOFORK
        이진탐색트리 binary_search_tree BST
        WtEn:binary_search_tree
       이진탐색트리 binary_search_tree
• 이진탐색,binary_search . . . . 4 matches
       [[이진탐색트리,binary_search_tree]] (BST)
       [[이진탐색트리,binary_search_tree,BST]]
       https://en.wikipedia.org/wiki/Binary_search_tree
       Up: [[이진탐색,binary_search]] [[탐색트리,search_tree]] [[이진트리,binary_tree]]
• 서치,search . . . . 1 match
       ex. [[탐색트리,search_tree]] [[검색엔진,search_engine]]
• 에이전트,agent . . . . 1 match
       [[상태공간그래프,state_space_graph]]에 [[순환,cycle]]이 없을 경우 이걸 [[탐색트리,search_tree]]로 만들 수 있다. 그래서 tree search 방식으로 문제풀기를 시도할 수 있다.

You can also click here to search title.