-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy path226.invert-binary-tree.cpp
More file actions
59 lines (55 loc) · 1.2 KB
/
226.invert-binary-tree.cpp
File metadata and controls
59 lines (55 loc) · 1.2 KB
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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
// Tag: Tree, Depth-First Search, Breadth-First Search, Binary Tree
// Time: O(N)
// Space: O(H)
// Ref: -
// Note: -
// Given the root of a binary tree, invert the tree, and return its root.
//
// Example 1:
//
//
// Input: root = [4,2,7,1,3,6,9]
// Output: [4,7,2,9,6,3,1]
//
// Example 2:
//
//
// Input: root = [2,1,3]
// Output: [2,3,1]
//
// Example 3:
//
// Input: root = []
// Output: []
//
//
// Constraints:
//
// The number of nodes in the tree is in the range [0, 100].
// -100 <= Node.val <= 100
//
//
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* invertTree(TreeNode* root) {
if(!root) {
return root;
}
TreeNode *left = root->left;
TreeNode *right = root->right;
root->left = invertTree(right);
root->right = invertTree(left);
return root;
}
};