FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
leetcode-algorithms/python/invert_binary_tree.py at master · anishLearnsToCode/leetcode-algorithms · GitHub
anishLearnsToCode
/
leetcode-algorithms
Public
Notifications
You must be signed in to change notification settings
Fork
17
Star
98
Code
Issues
0
Pull requests
0
Discussions
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Discussions
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
leetcode-algorithms
/
python
/
invert_binary_tree.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
17 lines (13 loc) · 451 Bytes
Breadcrumbs
leetcode-algorithms
/
python
/
invert_binary_tree.py
Copy path
File metadata and controls
17 lines (13 loc) · 451 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
# Definition for a binary tree node.
from
typing
import
Optional
class
TreeNode
:
def
__init__
(
self
,
val
=
0
,
left
=
None
,
right
=
None
):
self
.
val
=
val
self
.
left
=
left
self
.
right
=
right
class
Solution
:
def
invertTree
(
self
,
root
:
TreeNode
)
->
Optional
[
TreeNode
]:
if
root
is
None
:
return
None
root
.
left
,
root
.
right
=
self
.
invertTree
(
root
.
right
),
self
.
invertTree
(
root
.
left
)
return
root
Back
|
FazBrowse Home
|
New Git URL