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.
Q6554218 - link/cut tree
Searching link targets on 1 Wikipedias...
| Item | Label [en] | Wikilabels | Link # |
|---|---|---|---|
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 |
| Q331716 [CC | ] | amortized analysis | Amortized analysis | 1 |
| Q15995100 [CC | ] | Andrew V. Goldberg | Andrew V. Goldberg | 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 |
| Q803847 [CC | ] | binary heap | Binary heap | 1 |
| Q623818 [CC | ] | binary search tree | Binary search tree | 1 |
| Q864032 [CC | ] | binomial heap | Binomial heap | 1 |
| Q4972931 [CC | ] | brodal queue | Brodal queue | 1 |
| Q5003703 [CC | ] | Bx-tree | Bx-tree | 1 |
| Q5005969 [CC | ] | C-trie | C-trie | 1 |
| Q5047286 [CC | ] | Cartesian tree | Cartesian tree | 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 |
| Q730933 [CC | ] | Dinic's algorithm | Dinic's algorithm | 1 |
| Q20018775 [CC | ] | Dynamic connectivity | Dynamic connectivity | 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 |
| Q1506875 [CC | ] | forest | Forest (graph theory) | 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 |
| 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 |
| Q6057306 [CC | ] | interval tree | Interval tree | 1 |
| Q1709878 [CC | ] | Journal of the ACM | Journal of the ACM | 1 |
| Q309949 [CC | ] | k-d tree | K-d tree | 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 |
| Q6666764 [CC | ] | Log-structured merge-tree | Log-structured merge-tree | 1 |
| Q11197 [CC | ] | logarithm | Logarithm | 1 |
| Q3841143 [CC | ] | M-tree | M-tree | 1 |
| Q6719175 [CC | ] | MVP Tree | MVP tree | 1 |
| Q2585642 [CC | ] | maximum flow problem | Maximum flow problem | 1 |
| Q14746 [CC | ] | hash tree | Merkle tree | 1 |
| Q6824332 [CC | ] | Metric tree | Metric tree | 1 |
| Q1143237 [CC | ] | octree | Octree | 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 |
| Q4046245 [CC | ] | PQ tree | PQ tree | 1 |
| Q17152481 [CC | ] | pairing heap | Pairing heap | 1 |
| Q1453551 [CC | ] | parent pointer tree | Parent pointer tree | 1 |
| Q1784922 [CC | ] | Potential method | Potential method | 1 |
| Q7245465 [CC | ] | Priority R-tree | Priority R-tree | 1 |
| Q934791 [CC | ] | quadtree | Quadtree | 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 |
| Q92638 [CC | ] | Robert Tarjan | Robert Tarjan | 1 |
| Q63721528 [CC | ] | rooted tree | Rooted tree | 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 |
| Q1514741 [CC | ] | set | Set (abstract data type) | 1 |
| Q7534795 [CC | ] | Skew binomial heap | Skew binomial heap | 1 |
| Q4893208 [CC | ] | skew heap | Skew heap | 1 |
| Q80729 [CC | ] | splay tree | Splay tree | 1 |
| Q1426863 [CC | ] | suffix tree | Suffix tree | 1 |
| Q2562299 [CC | ] | T-tree | T-tree | 1 |
| Q2859802 [CC | ] | ternary search tree | Ternary search tree | 1 |
| Q2393193 [CC | ] | time complexity | Time complexity | 1 |
| Q7824733 [CC | ] | top tree | Top tree | 1 |
| Q1757700 [CC | ] | treap | Treap | 1 |
| Q223655 [CC | ] | tree | Tree (data structure) | 1 |
| Q272735 [CC | ] | tree | Tree (graph theory) | 1 |
| Q387015 [CC | ] | trie | Trie | 1 |
| Q2466492 [CC | ] | UB-tree | UB-tree | 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 |
| Q8045718 [CC | ] | Y-fast trie | Y-fast trie | 1 |