![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
tree
feeeeeeet
这个作者很懒,什么都没留下…
展开
-
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 · 116 阅读 · 0 评论 -
Leetcode 95 & 96. Unique Binary Search Trees I & II
Unique Binary Search Trees I Given n, how many structurally unique BST’s (binary search trees) that store values 1 … n? Example: Input: 3 Output: 5 class Solution(object): def numTrees(self, n)...原创 2019-01-02 05:04:54 · 83 阅读 · 0 评论 -
Leetcode 98. Validate Binary Search Tree
Same method to inorder traversal # Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = No...原创 2019-01-02 05:39:04 · 78 阅读 · 0 评论 -
Leetcode 99. Recover Binary Search Tree
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def recoverTree(s...原创 2019-01-07 03:31:36 · 120 阅读 · 0 评论 -
Leetcode 100 & 101. Same Tree & Symmetric Tree
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def isSameTree(se...原创 2019-01-07 03:33:12 · 94 阅读 · 0 评论 -
Leetcode 104 & 111. Minimum & Maximum Depth of Binary Tree
Maximum Depth of Binary Tree # Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class So...原创 2019-01-07 07:27:14 · 87 阅读 · 0 评论 -
Leetcode 102 & 107. Binary Tree Level Order Traversal I & II
Binary Tree Level Order Traversal Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root). For example: Given...原创 2019-01-18 03:41:03 · 101 阅读 · 0 评论 -
Leetcode 103. Binary Tree Zigzag Level Order Traversal
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def zigzagLevelOr...原创 2019-01-18 04:51:46 · 101 阅读 · 0 评论 -
Leetcode 105 & 106. Construct Binary Tree from Preorder and Inorder & Inorder and Postorder
hash Use a dictionary to store the number in inorder and its index. Find position of the root in inorder in O(1). slow version # Definition for a binary tree node. # class TreeNode: # def __init__...原创 2019-01-18 05:36:16 · 111 阅读 · 0 评论