Mira's Blog

摘要： **理论基础 ** void backtracking(参数) { if (终止条件) { 存放结果; return; } for (选择：本层集合中元素（树中节点孩子的数量就是集合的大小）) { 处理节点; backtracking(路径，选择列表); // 递归 回溯，撤销处理结果 } } 77 阅读全文

摘要： 669. 修剪二叉搜索树 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = 阅读全文

摘要： 235. 二叉搜索树的最近公共祖先 因为是搜索二叉树，所以只要值在q和p之间，那么就是lowest common ancestor # Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # se 阅读全文

摘要： 530.二叉搜索树的最小绝对差 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.lef 阅读全文

摘要： Scalability: an application / system can handle greater loads by adapting. There are two kinds of scalability Vertical Scalability (=scale up / down) 阅读全文

摘要： 654.最大二叉树 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = le 阅读全文

摘要： EBS (Elastic Block Store) Volume it is a network drive you can attach to you instances while they run it allows you instances to persist data, even af 阅读全文

摘要： 513.找树左下角的值 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = 阅读全文

摘要： 110.平衡二叉树 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = le 阅读全文

摘要： 104.二叉树的最大深度 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = 阅读全文