WikiCards
Play on iPhone nowFree in Safari. Add it to your Home Screen.Play
WikiCards · Card list · Nature cards · Binary search tree
Uncommon card · Nature
Binary search tree, an Uncommon card
In computer science, a binary search tree, also called an ordered or sorted binary tree, is a rooted binary tree data structure 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.
- Rarity
- Uncommon
- Domain
- Nature
- ATK
- 70
- DEF
- 58
- Power
- 128
- Wikipedia reads a year
- 92,000
Power 128 (ATK + DEF): stronger than 65 % of WikiCards cards.
Binary search tree quiz: 3 questions
Three questions on the Binary search tree card, the way WikiCards duels ask them. Pick an answer, the facts are just below.
Find the missing word
Binary search trees allow binary search for fast lookup, ______, and removal of data items.
Answer
addition. Binary search trees allow binary search for fast lookup, addition, and removal of data items. From the Binary search tree article on Wikipedia.
Which of these cards hits hardest (highest ATK)?
Answer
Lebesgue integral. Lebesgue integral 74 · Binary search tree 70 · Alder 67 · Leek 64 ATK in WikiCards.
Which of these Wikipedia articles is read the most in a year?
Answer
Leek. Leek 220,000 · Alder 160,000 · Binary search tree 92,000 · Bustard 66,000 Wikipedia reads over a year.
In a duel, each round asks a question like these about the opposing card, with 15 seconds to answer.
The facts on the card
The card carries these facts from its Wikipedia article.
- The time complexity of operations on the binary search tree is linear with respect to the height of the tree.
- Binary search trees allow binary search for fast lookup, addition, and removal of data items.
- Since the nodes in a BST are laid out so that each comparison skips about half of the remaining tree, the lookup performance is proportional to that of binary logarithm.
Why it is Uncommon
Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Binary search tree article was read about 92,000 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 70 and blocks with 58: each hit it takes is cut by 23 %.
How to get Binary search tree
Open packs. Each pack holds five cards drawn from real Wikipedia articles, the rarest last, and the fifth card is always Rare or better. The odds are shown in the game. A free pack arrives every hour and two can wait, and the Coins you win in duels buy more packs.
More Nature cards
Cards close in power
The cards just above and just below Binary search tree in the power ranking, all domains together.
- AsterismUncommon · Science · ATK 69 DEF 59
- ChanterelleUncommon · Nature · ATK 63 DEF 65
- Lebesgue integralUncommon · Science · ATK 74 DEF 54
- Adoor GopalakrishnanUncommon · Arts · ATK 72 DEF 56
- MuralUncommon · Arts · ATK 72 DEF 56
- BroadcastingUncommon · Science · ATK 71 DEF 57
Card lists
- Wikipedia quizNew questions every day
- All cards from A to ZEvery card, by name
- Nature cards
- Legendary cards
- Tier listS and A tiers by power (ATK + DEF)
Credits
Text : Wikipedia, Binary search tree (revision), CC BY-SA 4.0. Photo : No machine-readable author provided. Dcoetzee assumed (based on copyright claims)., Public domain, Wikimedia Commons.
