Leetcode_總結】94. 二叉樹的中序遍歷 - python
阿新 • • 發佈:2019-01-11
Q:
給定一個二叉樹,返回它的中序 遍歷。
示例:
輸入: [1,null,2,3] 1 \ 2 / 3 輸出: [1,3,2]
連結:https://leetcode-cn.com/problems/binary-tree-inorder-traversal/description/
思路:遞迴 中序遍歷
程式碼:
# 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] """ if root == None: return [] else: res = [] self.middle_digui(root, res) return res def middle_digui(self,root,res): if root == None: return self.middle_digui(root.left,res) res.append(root.val) self.middle_digui(root.right,res)