Everything About ___
Live briefing

Everything about M-ary tree

Tree data structure in which each node has at most m children

In graph theory, an m-ary tree is an arborescence in which each node has no more than m children. A binary tree is an important case where m = 2; similarly, a ternary tree is one where m = 3. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: M-ary treeA 5-minute orientation
  2. Skim a recent paper: Interactive Tree of Life (iTOL) v6: recent updates to the phylogenetic tree display and annotation toolInfluential work since 2022
  3. Pick up a classic book: Wholesale price list for the nursery trade of forest, ornamental and fruit tree seed seeds of shrubs, conifers, palms and evergreens rare seed unusual, exotic and newly introduced trees, shrubs and evergreens from all parts of the EarthThe most-reprinted book on the subject
  4. Read the landmark paper: IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood PhylogeniesCited 25,767 times
  5. Go sideways: Kraft–McMillan inequalityA closely related topic
  6. Go sideways: Longest common substringA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics