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.
Q837274 - Van Emde Boas tree
Searching link targets on 8 Wikipedias...
Item | Label [en] | Wikilabels | Link # |
---|---|---|---|
Q677051 [CC | ![]() | B-tree | B-cây | درخت بی | B-tree | Б-дерево | Arbre B | 5 |
Q300159 [CC | ![]() | AVL tree | Cây AVL | درخت ایویال | AVL tree | АВЛ-дерево | Arbre AVL | 5 |
Q1426863 [CC | ![]() | suffix tree | Cây hậu tố | درخت پسوندی | Suffix tree | Суфіксне дерево | Arbre des suffixes | 5 |
Q623818 [CC | ![]() | binary search tree | Cây tìm kiếm nhị phân | درخت جستجوی دودویی | Binary search tree | Двійкове дерево пошуку | Arbre binaire de recherche | 5 |
Q387015 [CC | ![]() | trie | Trie | درخت پیشوندی | Префіксне дерево | Trie (informatique) | 5 |
Q274089 [CC | ![]() | heap | Đống (cấu trúc dữ liệu) | هرم (ساختمان داده) | Heap (data structure) | Купа (структура даних) | Tas (informatique) | 5 |
Q223655 [CC | ![]() | tree | Cây (cấu trúc dữ liệu) | Tree (data structure) | Дерево (структура даних) | Arbre enraciné | 4 |
Q80729 [CC | ![]() | splay tree | Cây splay | Splay tree | Розширюване дерево | Arbre splay | 4 |
Q269878 [CC | ![]() | big O notation | Ký hiệu O lớn | نماد O بزرگ | Big O notation | ランダウの記号 | 4 |
Q2377385 [CC | ![]() | segment tree | درخت بازهها | Segment tree | Дерево відрізків | Arbre de segments | 4 |
Q14746 [CC | ![]() | hash tree | درخت درهمسازی | Merkle tree | Дерево Меркла | Arbre de Merkle | 4 |
Q506496 [CC | ![]() | red–black tree | درخت سرخ-سیاه | Red–black tree | Червоно-чорне дерево | Arbre bicolore | 4 |
Q1356176 [CC | ![]() | Patricia tree | درخت مبنا | Radix tree | Базисне дерево | Arbre radix | 4 |
Q1143237 [CC | ![]() | octree | Octree | درخت هشتتایی | Дерево октантів | 4 |
Q309949 [CC | ![]() | k-d tree | درخت کیدی | K-d tree | K-вимірне дерево | Arbre kd | 4 |
Q15840190 [CC | ![]() | Peter van Emde Boas | Peter van Emde Boas | 3 |
Q169233 [CC | ![]() | 2–3–4 tree | Cây 2-3-4 | 2–3–4 tree | Arbre 2-3-4 | 3 |
Q380172 [CC | ![]() | binary tree | Cây nhị phân | درخت دودویی | Arbre binaire | 3 |
Q1757700 [CC | ![]() | treap | Treap | 3 |
Q2902363 [CC | ![]() | SPQR tree | درخت اسپیکیوآر | SPQR tree | Arbre SPQR | 3 |
Q285861 [CC | ![]() | B+ tree | درخت بیپلاس | B+ tree | B+ дерево | 3 |
Q10854318 [CC | ![]() | left-child right-sibling binary tree | درخت دودویی فرزند-چپ همزاد-راست | Left-child right-sibling binary tree | Doubly chained tree | 3 |
Q1276370 [CC | ![]() | Fenwick tree | درخت فنویک | Fenwick tree | Дерево Фенвіка | 3 |
Q818944 [CC | ![]() | range tree | درخت محدوده | Range tree | Arbre de portée | 3 |
Q80585 [CC | ![]() | associative array | Associative array | Асоціативний масив | Tableau associatif | 3 |
Q803847 [CC | ![]() | binary heap | Binary heap | Двійкова купа | Tas binaire | 3 |
Q864032 [CC | ![]() | binomial heap | Binomial heap | Біноміальна купа | Tas binomial | 3 |
Q5047286 [CC | ![]() | Cartesian tree | Cartesian tree | Декартове дерево | Arbre cartésien | 3 |
Q1410737 [CC | ![]() | Fibonacci heap | Fibonacci heap | Фібоначчієва купа | Tas de Fibonacci | 3 |
Q207440 [CC | ![]() | hash table | Hash table | Table de hachage | ハッシュテーブル | 3 |
Q4046245 [CC | ![]() | PQ tree | PQ tree | PQ-дерево | Arbre PQ | 3 |
Q934791 [CC | ![]() | quadtree | Quadtree | Дерево квадрантів | 3 |
Q1198051 [CC | ![]() | R-tree | R-tree | R-дерево | R-arbre | 3 |
Q2859802 [CC | ![]() | ternary search tree | Ternary search tree | Трійкове дерево пошуку | Arbre ternaire de recherche | 3 |
Q21198 [CC | ![]() | computer science | Informatik | Khoa học máy tính | 2 |
Q629283 [CC | ![]() | priority queue | Vorrangwarteschlange | Kolejka priorytetowa | 2 |
Q175263 [CC | ![]() | data structure | Cấu trúc dữ liệu | Structure de données | 2 |
Q494950 [CC | ![]() | list of data structures | Danh sách cấu trúc dữ liệu | List of data structures | 2 |
Q648266 [CC | ![]() | Wayback Machine | Wayback Machine | 2 |
Q2078122 [CC | ![]() | dancing tree | Dancing tree | 2 |
Q5421528 [CC | ![]() | exponential tree | Exponential tree | Arbre exponentiel | 2 |
Q6057306 [CC | ![]() | interval tree | Interval tree | Arbre d'intervalles | 2 |
Q6666764 [CC | ![]() | Log-structured merge-tree | Log-structured merge-tree | LSM-дерево | 2 |
Q6824332 [CC | ![]() | Metric tree | Metric tree | Arbre métrique | 2 |
Q3566140 [CC | ![]() | scapegoat tree | Scapegoat tree | Arbre bouc-émissaire | 2 |
Q621673 [CC | ![]() | search tree | Search tree | Дерево пошуку | 2 |
Q1514741 [CC | ![]() | set | Set (abstract data type) | Множина (тип даних) | 2 |
Q2098905 [CC | ![]() | space complexity | Space complexity | Complexité en espace | 2 |
Q2393193 [CC | ![]() | time complexity | Time complexity | Complexité en temps | 2 |
Q2466492 [CC | ![]() | UB-tree | UB-tree | UB-дерево | 2 |
Q7915197 [CC | ![]() | Vantage-point tree | Vantage-point tree | Vantage point tree | 2 |
Q863513 [CC | ![]() | binary space partitioning | Бінарне розбиття простору | Partition binaire de l'espace | 2 |
Q2302053 [CC | ![]() | spatial database | Просторова база даних | Base de données spatiales | 2 |
Q288510 [CC | ![]() | run time | Laufzeit (Informatik) | 1 |
Q21199 [CC | ![]() | natural number | Số tự nhiên | 1 |
Q16047696 [CC | ![]() | No label in en! | درخت وب بدوی | 1 |
Q582659 [CC | ![]() | exponential growth | رشد نمایی | 1 |
Q12503 [CC | ![]() | integer | عدد صحیح | 1 |
Q4544940 [CC | ![]() | (a,b)-tree | (a,b)-tree | 1 |
Q169338 [CC | ![]() | 2–3 tree | 2–3 tree | 1 |
Q3490262 [CC | ![]() | AA tree | AA tree | 1 |
Q4835786 [CC | ![]() | Bk-tree | BK-tree | 1 |
Q4851284 [CC | ![]() | Ball tree | Ball tree | 1 |
Q1992074 [CC | ![]() | bit array | Bit array | 1 |
Q4972931 [CC | ![]() | brodal queue | Brodal queue | 1 |
Q5003703 [CC | ![]() | Bx-tree | Bx-tree | 1 |
Q5005969 [CC | ![]() | C-trie | C-trie | 1 |
Q93028 [CC | ![]() | Charles E. Leiserson | Charles E. Leiserson | 1 |
Q2024396 [CC | ![]() | Clifford Stein | Clifford Stein | 1 |
Q13108095 [CC | ![]() | Cover tree | Cover tree | 1 |
Q5191786 [CC | ![]() | concurrent hash-trie | Ctrie | 1 |
Q5203305 [CC | ![]() | d-ary heap | D-ary 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 |
Q5924569 [CC | ![]() | Htree | HTree | 1 |
Q5678847 [CC | ![]() | Hash calendar | Hash calendar | 1 |
Q16948622 [CC | ![]() | hash tree | Hash tree (persistent 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 |
Q13407970 [CC | ![]() | Integer sorting | Integer sorting | 1 |
Q1141518 [CC | ![]() | Introduction to Algorithms | Introduction to Algorithms | 1 |
Q460340 [CC | ![]() | Isabelle | Isabelle (proof assistant) | 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 |
Q3841143 [CC | ![]() | M-tree | M-tree | 1 |
Q73820 [CC | ![]() | The MIT Press | MIT Press | 1 |
Q6719175 [CC | ![]() | MVP Tree | MVP tree | 1 |
Q17154715 [CC | ![]() | Optimal binary search tree | Optimal binary search tree | 1 |
Q7100701 [CC | ![]() | order statistic tree | Order statistic tree | 1 |
Q111955008 [CC | ![]() | PH-tree | PH-tree | 1 |
Q17152481 [CC | ![]() | pairing heap | Pairing heap | 1 |
Q48999705 [CC | ![]() | predecessor problem | Predecessor problem | 1 |
Q7245465 [CC | ![]() | Priority R-tree | Priority R-tree | 1 |
Q6451502 [CC | ![]() | R+ tree | R+ tree | 1 |
Q7534795 [CC | ![]() | Skew binomial heap | Skew binomial heap | 1 |
Q4893208 [CC | ![]() | skew heap | Skew heap | 1 |
Q597330 [CC | ![]() | Standard ML | Standard ML | 1 |
Q2562299 [CC | ![]() | T-tree | T-tree | 1 |
Q7683117 [CC | ![]() | tango tree | Tango tree | 1 |
Q2524992 [CC | ![]() | Thomas H. Cormen | Thomas H. Cormen | 1 |
Q7824733 [CC | ![]() | top tree | Top 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 |
Q8045718 [CC | ![]() | Y-fast trie | Y-fast trie | 1 |
Q6451496 [CC | ![]() | R*-tree | R*-дерево | 1 |
Q176916 [CC | ![]() | Springer Science+Business Media | Springer Science+Business Media | 1 |
Q272735 [CC | ![]() | tree | Дерево (теорія графів) | 1 |
Q7897401 [CC | ![]() | unrooted binary tree | Некореневе двійкове дерево | 1 |
Q543287 [CC | ![]() | null | Literał pusty | 1 |
Q597663 [CC | ![]() | universe | Uniwersum (matematyka) | 1 |
Q1428376 [CC | ![]() | Polish Scientific Publishers PWN | Wydawnictwo Naukowe PWN | 1 |
Q2479 [CC | ![]() | 1975 | 1975 | 1 |
Q852081 [CC | ![]() | threaded binary tree | Arbre cousu | 1 |
Q240464 [CC | ![]() | minimum spanning tree | Arbre couvrant de poids minimal | 1 |
Q2859758 [CC | ![]() | No label in en! | Arbre de fouille | 1 |
Q127380 [CC | ![]() | abstract syntax tree | Arbre de la syntaxe abstraite | 1 |
Q24882695 [CC | ![]() | Relaxed k-d tree | Arbre kd relaxé | 1 |
Q627921 [CC | ![]() | parse tree | Arbre syntaxique | 1 |
Q29791656 [CC | ![]() | balanced tree | Arbre équilibré | 1 |
Q25670 [CC | ![]() | digital object identifier | Digital Object Identifier | 1 |
Q2878974 [CC | ![]() | theoretical computer science | Informatique théorique | 1 |
Q33057 [CC | ![]() | International Standard Book Number | International Standard Book Number | 1 |
Q131276 [CC | ![]() | International Standard Serial Number | International Standard Serial Number | 1 |
Q7411 [CC | ![]() | Dutch | Néerlandais | 1 |
Q200569 [CC | ![]() | Dutch | Néerlandais (peuple) | 1 |
Q2597810 [CC | ![]() | SUDOC | Système universitaire de documentation | 1 |
Q924265 [CC | ![]() | Aarhus University | Université d'Aarhus | 1 |