33:I[58905,["$4","$5","$6","$7","$13","$14"],"WorkspaceClient"] 34:T433,function main() { const input = fs.readFileSync(0, 'utf-8').trim(); if (!input) return; const tokens = input.split(/\s+/); if (!tokens || tokens[0] === '-1') return; const root = new Node(Number(tokens[0])); const queue = [root]; let i = 1; while (queue.length > 0 && i < tokens.length) { const curr = queue.shift(); if (tokens[i] !== '-1') { curr.left = new Node(Number(tokens[i])); queue.push(curr.left); } i++; if (i < tokens.length && tokens[i] !== '-1') { curr.right = new Node(Number(tokens[i])); queue.push(curr.right); } i++; } const inverted = invertTree(root); const out = []; const outQ = [inverted]; while (outQ.length > 0) { const node = outQ.shift(); if (node) { out.push(node.val); if (node.left || node.right) { outQ.push(node.left); outQ.push(node.right); } } } console.log(out.join(' ')); } main();35:T4fd,int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string token; vector tokens; while (cin >> token) tokens.push_back(token); if (tokens.empty() || tokens[0] == "-1") return 0; Node* root = new Node(stoi(tokens[0])); queue q; q.push(root); size_t i = 1; while (!q.empty() && i < tokens.size()) { Node* curr = q.front(); q.pop(); if (tokens[i] != "-1") { curr->left = new Node(stoi(tokens[i])); q.push(curr->left); } i++; if (i < tokens.size() && tokens[i] != "-1") { curr->right = new Node(stoi(tokens[i])); q.push(curr->right); } i++; } Node* inverted = invertTree(root); vector out; queue outQ; outQ.push(inverted); while (!outQ.empty()) { Node* node = outQ.front(); outQ.pop(); if (node) { out.push_back(node->val); if (node->left || node->right) { outQ.push(node->left); outQ.push(node->right); } } } for (size_t j = 0; j < out.size(); ++j) { cout << out[j] << (j + 1 == out.size() ? "" : " "); } cout << "\n"; return 0; }36:T703,

Invert Binary Tree

Problem Statement

Sample Cases

Constraints