How to form a k-nary tree with x nodes.
Is there any way to find whether a k-nary tree(need not be perfect or complete) which have x nodes exists or not. If exits then how to find it.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
5 | atcoder_official | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
How to form a k-nary tree with x nodes.
How to form a k-nary tree with x nodes.
Is there any way to find whether a k-nary tree(need not be perfect or complete) which have x nodes exists or not. If exits then how to find it.
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en4 | noob_master | 2020-01-10 09:02:17 | 7 | |||
en3 | noob_master | 2020-01-10 09:00:49 | 61 | |||
en2 | noob_master | 2020-01-09 16:59:08 | 18 | |||
en1 | noob_master | 2020-01-09 16:57:57 | 233 | Initial revision (published) |
Название |
---|