Leetcode 94 & 102 & 144 & 145. Binary Tree Traversal (dfs & bfs)
stack
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def inorder...
原创
2018-12-31 20:00:57 ·
114 阅读 ·
0 评论