Given a binary tree, return the inorder traversal of its nodes' values.
Example:
Input: [1,null,2,3]
1
2
/
3
Output: [1,3,2]
My code:
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def inorderTraversal(self, root):
"""
:type root: TreeNode
:rtype: List[int]
"""
self.res=[]
self.transverse(root)
return self.res
def transverse(self,root):
if root!=None:
if root.left!=None:
self.transverse(root.left)
self.res.append(root.val)
if root.right!=None:
self.transverse(root.right)
Solution: https://leetcode.com/problems/binary-tree-inorder-traversal/