| 10 | }; |
| 11 | |
| 12 | Node *make_tree(int depth, Int &counter) { |
| 13 | Node *node = new Node(); |
| 14 | if (depth != 0) { |
| 15 | node->left = make_tree(depth - 1, counter); |
| 16 | node->val = counter++; |
| 17 | node->right = make_tree(depth - 1, counter); |
| 18 | } else { |
| 19 | node->val = counter++; |
| 20 | } |
| 21 | return node; |
| 22 | } |
| 23 | |
| 24 | Int sum_tree(Node *node) { |
| 25 | Int result = 0; |