Timeline for mapping integers to k-ary trees
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 15, 2021 at 4:55 | vote | accept | Sohrab T | ||
| Aug 14, 2021 at 8:42 | answer | added | Brendan McKay | timeline score: 3 | |
| Aug 13, 2021 at 22:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Apr 15, 2021 at 21:44 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 16, 2020 at 20:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 18, 2020 at 19:05 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Apr 20, 2020 at 19:04 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 22, 2019 at 18:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 22, 2019 at 18:34 | comment | added | Wlod AA | Yes, given a non-negative integer, you extract k new integers (corresponding to children) by collecting the digits on the position = r mod k to form the r-th integer. | |
| Nov 22, 2019 at 18:24 | comment | added | Wlod AA | Do everything by analogy. You'll use base k notation. You'll have k children each time (some of them may be empty, corresponding to digit 0. (I better go back to that link and have another look). | |
| Nov 22, 2019 at 17:53 | comment | added | Sohrab T | I have tried extending it to the case of an n-ary tree and encountered a complication. At the end of the algorithm suggested by Tychonievich, he splits the integer into two separate integers, one for the right child and another for the left child. If I have an n-ary tree, it is not clear how many children there would be. | |
| Nov 22, 2019 at 4:50 | comment | added | Wlod AA | It seems that you can follow the 2-ary solution from the link you have provided. I don't see any complication, the generalization seems to be straightforward. | |
| Nov 22, 2019 at 4:20 | comment | added | Wlod AA | There is more than one way to count k-ary trees, meaning that the numeric values will be different (there are different equivalence relations...). Would you spell your definition explicitly in your Question? | |
| Nov 22, 2019 at 3:30 | review | First posts | |||
| Nov 22, 2019 at 3:58 | |||||
| Nov 22, 2019 at 3:26 | history | asked | Sohrab T | CC BY-SA 4.0 |