Information for "M-ary tree"
Basic information
| Display title | m-ary tree |
| Default sort key | M-ary tree |
| Page length (in bytes) | 18,394 |
| Namespace ID | 0 |
| Page ID | 2145273 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 30 |
| Number of page watchers who visited in the last 30 days | There may or may not be a watching user visiting recent edits |
| Number of redirects to this page | 4 |
| Counted as a content page | Yes |
| Wikidata item ID | Q3608019 |
| Local description | Tree data structure in which each node has at most m children. |
| Central description | Tree data structure in which each node has at most K children. From a graph theoretical perspective, k-ary trees are actually arborescences. |
| Page image |  |
| Page views in the past 30 days |
Page protection
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
Edit history
| Page creator | Agthorr (talk | contribs) |
| Date of page creation | 19:09, 30 June 2005 |
| Latest editor | Dragifon (talk | contribs) |
| Date of latest edit | 07:20, 4 June 2024 |
| Total number of edits | 167 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |