[LeetCode - Binary Tree] 94. Binary Tree Inorder Traversal
题目来源
题意分析
给定一个二叉树,返回它的中序遍历。
示例:
输入: [1,null,2,3]
1
\
2
/
3
输出: [1,3,2]
解题思路
使用递归方式,中序遍历整棵树。
答题源码
# 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]
"""
list = []
self.traversal(root, list)
return list
def traversal(self, root, list):
if(root != None):
if root.left != None:
self.traversal(root.left, list)
list.append(root.val)
if root.right != None:
self.traversal(root.right, list)