mirror of
https://github.com/devenperez/leetcode.git
synced 2026-06-15 09:57:09 +00:00
Deven
29 lines
663 B
Python
29 lines
663 B
Python
# Definition for a binary tree node.
|
|
# class TreeNode:
|
|
# def __init__(self, val=0, left=None, right=None):
|
|
# self.val = val
|
|
# self.left = left
|
|
# self.right = right
|
|
class Solution:
|
|
def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
|
|
"""
|
|
Complexities:
|
|
Time: O(n)
|
|
Space: O(n)
|
|
|
|
where n = total node in graph
|
|
"""
|
|
|
|
if not root:
|
|
return []
|
|
|
|
arr = []
|
|
if root.left:
|
|
arr += self.inorderTraversal(root.left)
|
|
|
|
arr += [root.val]
|
|
|
|
if root.right:
|
|
arr += self.inorderTraversal(root.right)
|
|
|
|
return arr |