forked from neetcode-gh/leetcode
- Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path0226-invert-binary-tree.swift
26 lines (25 loc) · 786 Bytes
/
0226-invert-binary-tree.swift
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
/**
* Definition for a binary tree node.
* public class TreeNode {
* public var val: Int
* public var left: TreeNode?
* public var right: TreeNode?
* public init() { self.val = 0; self.left = nil; self.right = nil; }
* public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; }
* public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) {
* self.val = val
* self.left = left
* self.right = right
* }
* }
*/
classSolution{
func invertTree(_ root:TreeNode?)->TreeNode?{
guard root !=nilelse{return root }
letleft=invertTree(root?.left)
letright=invertTree(root?.right)
root?.left = right
root?.right = left
return root
}
}