This tool looks for unlabeled Wikidata items in your language. It starts with a Wikidata item,
looks at all the associated Wikipedia pages, the links on all those pages, and lists the Wikidata items corresponding to the link targets.
Q17154715 - Optimal binary search tree
Searching link targets on 3 Wikipedias...
| Item | Label [en] | Wikilabels | Link # |
|---|---|---|---|
Q623818 [CC |  ] | binary search tree | Binary search tree | درخت جستجوی دودویی | 2 |
| Q21198 [CC | ] | computer science | Computer science | علوم رایانه | 2 |
| Q494950 [CC | ] | list of data structures | List of data structures | فهرست ساختار داده | 2 |
| Q223655 [CC | ] | tree | Tree (data structure) | درخت (ساختار داده) | 2 |
| Q541347 [CC | ] | Tree rotation | Tree rotation | چرخش درخت | 2 |
| Q4544940 [CC | ] | (a,b)-tree | (a,b)-tree | 1 |
| Q169338 [CC | ] | 2–3 tree | 2–3 tree | 1 |
| Q169233 [CC | ] | 2–3–4 tree | 2–3–4 tree | 1 |
| Q3490262 [CC | ] | AA tree | AA tree | 1 |
| Q300159 [CC | ] | AVL tree | AVL tree | 1 |
| Q827335 [CC | ] | abstract data type | Abstract data type | 1 |
| Q18350805 [CC | ] | Alan Tucker | Alan Tucker | 1 |
| Q186152 [CC | ] | array data structure | Array (data structure) | 1 |
| Q4809579 [CC | ] | Association list | Association list | 1 |
| Q80585 [CC | ] | associative array | Associative array | 1 |
| Q285861 [CC | ] | B+ tree | B+ tree | 1 |
| Q677051 [CC | ] | B-tree | B-tree | 1 |
| Q4835786 [CC | ] | Bk-tree | BK-tree | 1 |
| Q4851284 [CC | ] | Ball tree | Ball tree | 1 |
| Q269878 [CC | ] | big O notation | Big O notation | 1 |
| Q864155 [CC | ] | binary decision diagram | Binary decision diagram | 1 |
| Q803847 [CC | ] | binary heap | Binary heap | 1 |
| Q864032 [CC | ] | binomial heap | Binomial heap | 1 |
| Q1992074 [CC | ] | bit array | Bit array | 1 |
| Q4972931 [CC | ] | brodal queue | Brodal queue | 1 |
| Q850362 [CC | ] | brute-force search | Brute-force search | 1 |
| Q5003703 [CC | ] | Bx-tree | Bx-tree | 1 |
| Q5005969 [CC | ] | C-trie | C-trie | 1 |
| Q5047286 [CC | ] | Cartesian tree | Cartesian tree | 1 |
| Q1224994 [CC | ] | circular buffer | Circular buffer | 1 |
| Q17008256 [CC | ] | collection | Collection (abstract data type) | 1 |
| Q1643805 [CC | ] | container | Container (abstract data type) | 1 |
| Q13108095 [CC | ] | Cover tree | Cover tree | 1 |
| Q5191786 [CC | ] | concurrent hash-trie | Ctrie | 1 |
| Q5203305 [CC | ] | d-ary heap | D-ary heap | 1 |
| Q2078122 [CC | ] | dancing tree | Dancing tree | 1 |
| Q5218783 [CC | ] | Daniel Sleator | Daniel Sleator | 1 |
| Q175263 [CC | ] | data structure | Data structure | 1 |
| Q17008992 [CC | ] | deterministic acyclic finite state automaton | Deterministic acyclic finite state automaton | 1 |
| Q1195339 [CC | ] | directed acyclic graph | Directed acyclic graph | 1 |
| Q1259393 [CC | ] | disjoint-set data structure | Disjoint-set data structure | 1 |
| Q17457 [CC | ] | Donald Knuth | Donald Knuth | 1 |
| Q5299591 [CC | ] | double-ended priority queue | Double-ended priority queue | 1 |
| Q1192005 [CC | ] | double-ended queue | Double-ended queue | 1 |
| Q128555 [CC | ] | dynamic array | Dynamic array | 1 |
| Q380679 [CC | ] | dynamic programming | Dynamic programming | 1 |
| Q1530048 [CC | ] | Edgar Gilbert | Edgar Gilbert | 1 |
| Q92882 [CC | ] | Edward F. Moore | Edward F. Moore | 1 |
| Q204570 [CC | ] | information entropy | Entropy (information theory) | 1 |
| Q3531564 [CC | ] | Erik Demaine | Erik Demaine | 1 |
| Q200125 [CC | ] | expectation | Expected value | 1 |
| Q5421528 [CC | ] | exponential tree | Exponential tree | 1 |
| Q1276370 [CC | ] | Fenwick tree | Fenwick tree | 1 |
| Q1410737 [CC | ] | Fibonacci heap | Fibonacci heap | 1 |
| Q11186393 [CC | ] | Finger tree | Finger tree | 1 |
| Q17014592 [CC | ] | Fractal tree index | Fractal tree index | 1 |
| Q5510283 [CC | ] | fusion tree | Fusion tree | 1 |
| Q60791212 [CC | ] | Garsia–Wachs algorithm | Garsia–Wachs algorithm | 1 |
| Q17016415 [CC | ] | Geometry of binary search trees | Geometry of binary search trees | 1 |
| Q951050 [CC | ] | God's algorithm | God's algorithm | 1 |
| Q2479726 [CC | ] | graph data structure | Graph (abstract data type) | 1 |
| Q504353 [CC | ] | greedy algorithm | Greedy algorithm | 1 |
| Q5924569 [CC | ] | Htree | HTree | 1 |
| Q5678847 [CC | ] | Hash calendar | Hash calendar | 1 |
| Q207440 [CC | ] | hash table | Hash table | 1 |
| Q16948622 [CC | ] | hash tree | Hash tree (persistent data structure) | 1 |
| Q5678892 [CC | ] | hashed array tree | Hashed array tree | 1 |
| Q274089 [CC | ] | heap | Heap (data structure) | 1 |
| Q5761197 [CC | ] | Hilbert R-tree | Hilbert R-tree | 1 |
| Q17029017 [CC | ] | iDistance | IDistance | 1 |
| Q6007297 [CC | ] | Implicit k-d tree | Implicit k-d tree | 1 |
| Q25303770 [CC | ] | Interleave lower bound | Interleave lower bound | 1 |
| Q6057306 [CC | ] | interval tree | Interval tree | 1 |
| Q23303114 [CC | ] | John Iacono | John Iacono | 1 |
| Q309949 [CC | ] | k-d tree | K-d tree | 1 |
| Q90313 [CC | ] | Kurt Mehlhorn | Kurt Mehlhorn | 1 |
| Q10854318 [CC | ] | left-child right-sibling binary tree | Left-child right-sibling binary tree | 1 |
| Q6516757 [CC | ] | Left-leaning red–black tree | Left-leaning red–black tree | 1 |
| Q627595 [CC | ] | leftist tree | Leftist tree | 1 |
| Q6554218 [CC | ] | link/cut tree | Link/cut tree | 1 |
| Q6554356 [CC | ] | linked data structure | Linked data structure | 1 |
| Q7003418 [CC | ] | linked list | Linked list | 1 |
| Q27948 [CC | ] | list | List (abstract data type) | 1 |
| Q1190519 [CC | ] | list of unsolved problems in computer science | List of unsolved problems in computer science | 1 |
| Q6666764 [CC | ] | Log-structured merge-tree | Log-structured merge-tree | 1 |
| Q3841143 [CC | ] | M-tree | M-tree | 1 |
| Q6719175 [CC | ] | MVP Tree | MVP tree | 1 |
| Q14746 [CC | ] | hash tree | Merkle tree | 1 |
| Q6824332 [CC | ] | Metric tree | Metric tree | 1 |
| Q6845108 [CC | ] | Mihai Pătrașcu | Mihai Pătrașcu (computer scientist) | 1 |
| Q6934758 [CC | ] | multimap | Multimap | 1 |
| Q1143237 [CC | ] | octree | Octree | 1 |
| Q1321906 [CC | ] | open problem | Open problem | 1 |
| Q2333568 [CC | ] | Optimal substructure | Optimal substructure | 1 |
| Q984063 [CC | ] | optimization problem | Optimization problem | 1 |
| Q7100701 [CC | ] | order statistic tree | Order statistic tree | 1 |
| Q111955008 [CC | ] | PH-tree | PH-tree | 1 |
| Q4046245 [CC | ] | PQ tree | PQ tree | 1 |
| Q17152481 [CC | ] | pairing heap | Pairing heap | 1 |
| Q118155 [CC | ] | pointer | Pointer (computer programming) | 1 |
| Q7245465 [CC | ] | Priority R-tree | Priority R-tree | 1 |
| Q629283 [CC | ] | priority queue | Priority queue | 1 |
| Q934791 [CC | ] | quadtree | Quadtree | 1 |
| Q220543 [CC | ] | queue | Queue (abstract data type) | 1 |
| Q6451502 [CC | ] | R+ tree | R+ tree | 1 |
| Q1198051 [CC | ] | R-tree | R-tree | 1 |
| Q1356176 [CC | ] | Patricia tree | Radix tree | 1 |
| Q818944 [CC | ] | range tree | Range tree | 1 |
| Q506496 [CC | ] | red–black tree | Red–black tree | 1 |
| Q108266414 [CC | ] | Retrieval Data Structure | Retrieval Data Structure | 1 |
| Q92638 [CC | ] | Robert Tarjan | Robert Tarjan | 1 |
| Q2902363 [CC | ] | SPQR tree | SPQR tree | 1 |
| Q3566140 [CC | ] | scapegoat tree | Scapegoat tree | 1 |
| Q621673 [CC | ] | search tree | Search tree | 1 |
| Q2377385 [CC | ] | segment tree | Segment tree | 1 |
| Q245955 [CC | ] | self-balancing binary search tree | Self-balancing binary search tree | 1 |
| Q1514741 [CC | ] | set | Set (abstract data type) | 1 |
| Q7534795 [CC | ] | Skew binomial heap | Skew binomial heap | 1 |
| Q4893208 [CC | ] | skew heap | Skew heap | 1 |
| Q2005893 [CC | ] | skip list | Skip list | 1 |
| Q1050404 [CC | ] | sparse matrix | Sparse matrix | 1 |
| Q80729 [CC | ] | splay tree | Splay tree | 1 |
| Q177929 [CC | ] | stack | Stack (abstract data type) | 1 |
| Q1426863 [CC | ] | suffix tree | Suffix tree | 1 |
| Q2562299 [CC | ] | T-tree | T-tree | 1 |
| Q102122804 [CC | ] | Te Chiang Hu | T. C. Hu | 1 |
| Q7683117 [CC | ] | tango tree | Tango tree | 1 |
| Q2859802 [CC | ] | ternary search tree | Ternary search tree | 1 |
| Q82438 [CC | ] | The Art of Computer Programming | The Art of Computer Programming | 1 |
| Q7824733 [CC | ] | top tree | Top tree | 1 |
| Q1757700 [CC | ] | treap | Treap | 1 |
| Q387015 [CC | ] | trie | Trie | 1 |
| Q2466492 [CC | ] | UB-tree | UB-tree | 1 |
| Q4388313 [CC | ] | unrolled linked list | Unrolled linked list | 1 |
| Q837274 [CC | ] | Van Emde Boas tree | Van Emde Boas tree | 1 |
| Q7915197 [CC | ] | Vantage-point tree | Vantage-point tree | 1 |
| Q25304407 [CC | ] | weak heap | Weak heap | 1 |
| Q7979855 [CC | ] | weight-balanced tree | Weight-balanced tree | 1 |
| Q8041554 [CC | ] | X-fast trie | X-fast trie | 1 |
| Q4021212 [CC | ] | X-tree | X-tree | 1 |
| Q607967 [CC | ] | XOR linked list | XOR linked list | 1 |
| Q8045718 [CC | ] | Y-fast trie | Y-fast trie | 1 |
| Q1860 [CC | ] | English | زبان انگلیسی | 1 |
| Q33057 [CC | ] | International Standard Book Number | شماره استاندارد بینالمللی کتاب | 1 |
| Q328 [CC | ] | English Wikipedia | ویکیپدیای انگلیسی | 1 |