![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法刷题
冬日and暖阳
Github: https://github.com/pengfeidip
邮箱:pengfeidip@qq.com
展开
-
leetcode-655-输出二叉树
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def printTree(self, root: TreeNode) -> List[List[str]]: depth原创 2020-05-17 20:51:14 · 152 阅读 · 0 评论 -
leetcode-217 合并二叉树
递归法 # Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def mergeTrees...原创 2020-03-03 18:34:18 · 155 阅读 · 0 评论 -
二叉树的遍历-前序遍历-中序遍历-后序遍历
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def preorderTrave...原创 2020-03-02 19:40:37 · 88 阅读 · 0 评论