Tree, an Uncommon card

The card carries these facts from its Wikipedia article.

• Each node in the tree can be connected to many children, but must be connected to exactly one parent, except for the root node, which has no parent.
• These constraints mean there are no cycles or "loops", and also that each child can be treated like the root node of its own subtree, making recursion a useful technique for tree traversal.
• In contrast to linear data structures, many trees cannot be represented by relationships between neighboring nodes in a single straight line.

Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Tree article was read about 43,000 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 63 and blocks with 42: each hit it takes is cut by 17 %.

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.

The cards just above and just below Tree in the power ranking, all domains together.