Viewing a response to: @gasparcha/re-justyy-c-coding-exercise-find-maximum-depth-of-n-ary-tree-n-20180806t082456353z
Hi, the first part is English and the second part is Chinese translation. it is bilingual.
| author | justyy |
|---|---|
| permlink | re-gasparcha-re-justyy-c-coding-exercise-find-maximum-depth-of-n-ary-tree-n-20180806t101908229z |
| category | programming |
| json_metadata | {"tags":["programming"],"app":"steemit/0.1"} |
| created | 2018-08-06 10:19:06 |
| last_update | 2018-08-06 10:19:06 |
| depth | 2 |
| children | 1 |
| last_payout | 2018-08-13 10:19:06 |
| cashout_time | 1969-12-31 23:59:59 |
| total_payout_value | 0.000 HBD |
| curator_payout_value | 0.000 HBD |
| pending_payout_value | 0.000 HBD |
| promoted | 0.000 HBD |
| body_length | 90 |
| author_reputation | 280,616,224,641,976 |
| root_title | "C++ Coding Exercise - Find Maximum Depth of N-ary Tree - 编程练习题：找出N叉树的深度" |
| beneficiaries | [] |
| max_accepted_payout | 1,000,000.000 HBD |
| percent_hbd | 10,000 |
| post_id | 67,282,254 |
| net_rshares | 6,146,589,697 |
| author_curate_reward | "" |
| voter | weight | wgt% | rshares | pct | time |
|---|---|---|---|---|---|
| dailyfortune | 0 | 66,032,285 | 20% | ||
| turtlegraphics | 0 | 2,106,890,654 | 20% | ||
| witnesstools | 0 | 2,008,612,489 | 20% | ||
| ilovecoding | 0 | 1,965,054,269 | 20% |
Cool, So I'm not missing anything, well, besides the things my brain can't quite fully understand yet xD Anyhow, thanks for the clases, wish i where proficient enough to get the 100% of them.
| author | gasparcha |
|---|---|
| permlink | re-justyy-re-gasparcha-re-justyy-c-coding-exercise-find-maximum-depth-of-n-ary-tree-n-20180806t103659271z |
| category | programming |
| json_metadata | {"community":"busy","app":"busy/2.5.4","format":"markdown","tags":["programming"],"users":[],"links":[],"image":[]} |
| created | 2018-08-06 10:37:00 |
| last_update | 2018-08-06 10:37:00 |
| depth | 3 |
| children | 0 |
| last_payout | 2018-08-13 10:37:00 |
| cashout_time | 1969-12-31 23:59:59 |
| total_payout_value | 0.000 HBD |
| curator_payout_value | 0.000 HBD |
| pending_payout_value | 0.000 HBD |
| promoted | 0.000 HBD |
| body_length | 191 |
| author_reputation | 4,745,797,952,486 |
| root_title | "C++ Coding Exercise - Find Maximum Depth of N-ary Tree - 编程练习题：找出N叉树的深度" |
| beneficiaries | [] |
| max_accepted_payout | 1,000,000.000 HBD |
| percent_hbd | 10,000 |
| post_id | 67,283,523 |
| net_rshares | 0 |
hiveblocks