binary_inorder_traversal.py

#Given the root of a binary tree, return the inorder traversal of its nodes' values.

# 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]:
         
            if root:
                return self.inorderTraversal(root.left) + [root.val]+ self.inorderTraversal(root.right)
            else:
                return []