aboutsummaryrefslogtreecommitdiff
path: root/invert_binary_tree.cpp
blob: e8f0585cdb8ad14ef5bdd1782ff293d64e5a0946 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
// 226. Invert Binary Tree
#include "leetcode.h"

// given 'root' of binary tree, invert the tree and return its root

class Solution {
public:
  TreeNode *invertTree(TreeNode *root) {
    if (root == nullptr)
      return root;
    queue<TreeNode *> q;
    q.push(root);
    while (!q.empty()) {
      TreeNode *node = q.front();
      q.pop();
      if (node->left != nullptr)
        q.push(node->left);
      if (node->right != nullptr)
        q.push(node->right);
      TreeNode *tmp = node->left;
      node->left = node->right;
      node->right = tmp;
    }
    return root;
  }
};