[LeetCode]226. Invert Binary Tree

题目描述

思路

广搜，对每个节点交换左右子节点

代码

/** * Definition for a binary tree node. * struct TreeNode { *     int val; *     TreeNode *left; *     TreeNode *right; *     TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:    TreeNode* invertTree(TreeNode* root) {        queue<TreeNode*> q;        q.push(root);        while (!q.empty()) {            TreeNode* node = q.front();            q.pop();            if (node) {                q.push(node->left);                q.push(node->right);                swap(node->left, node->right);            }        }        return root;    }};