read.me update

Author: tech-cow

README.md

@@ -75,35 +75,31 @@ Success is like pregnancy, Everybody congratulates you but nobody knows how many
 
 
 
-## 4/26 Tasks (Tree Easy)
-|  #  | Title | Solution | Time | Space | Difficulty |Tag| Note|
-|-----|-------| -------- | ---- | ------|------------|---|-----|
-|100|[Same Tree](https://leetcode.com/problems/same-tree/)| [Python [Yu]](./tree/Yu/100_isSameTree.py) <br> [Python [Sheng]](./tree/YeSheng/100.Same_Tree.py) | _O(N)_| _O(1)_  | Easy ||[EAFP vs. LBYL](https://github.com/ictar/python-doc/blob/master/Others/%E5%AE%9E%E7%94%A8Python%EF%BC%9AEAFP%20VS.%20LBYL.md)|
-
-|111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/#/description)| [Python [Yu]](https://github.com/yuzhoujr/LeetCode/blob/master/tree/Yu/111_minDepth.py) <br> [Python [Sheng]](https://github.com/yuzhoujr/LeetCode/blob/master/tree/YeSheng/111.Minimum_Depth_of_Binary_Tree.py) | _O(N)_| _O(1)_  | Easy |||
-|104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)| [Python](./tree/Yu/104_maxDepth.py) | _O(N)_| _O(1)_  | Easy | ||
-|235|[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/#/description)| [Python](./tree/Yu/235_lca_bst.py) | _O(N)_| _O(1)_  | Easy | ||
-
-
 ## Tree Easy
 |  #  | Title | Solution | Time | Space | Difficulty |Tag| Note|
 |-----|-------| -------- | ---- | ------|------------|---|-----|
+|100|[Same Tree](https://leetcode.com/problems/same-tree/)| [Python [Yu]](./tree/Yu/100_isSameTree.py) | _O(N)_| _O(1)_  | Easy |||
+|101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/#/description)| [Python [Yu]](./tree/Yu/101_symmetricTree.py)| _O(N)_| _O(1)_  | Easy ||[公瑾讲解](https://youtu.be/3Gl4F29LVpQ)|
+|104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)| [Python](./tree/Yu/104_maxDepth.py) | _O(N)_| _O(1)_  | Easy | ||
 |108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/#/solutions)| [Python [Yu]](./tree/Yu/108.py) | _O(N)_| _O(N)_  | Easy | |[公瑾讲解](https://www.youtube.com/watch?v=lBrb4fXPcMM)|
+|111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/#/description)| [Python [Yu]](https://github.com/yuzhoujr/LeetCode/blob/master/tree/Yu/111_minDepth.py)| _O(N)_| _O(1)_  | Easy |||
+|235|[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/#/description)| [Python](./tree/Yu/235_lca_bst.py) | _O(N)_| _O(1)_  | Easy | ||
 |226|[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/#/description)| [Python [Yu]](./tree/Yu/226.py) | _O(N)_| _O(1)_  | Easy | |[公瑾讲解](https://youtu.be/oiX3mqcAK0s)|
 |543|[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/#/description)| [Python [Yu]](./tree/Yu/543.py) | _O(N)_| _O(h)_  | Easy | |[公瑾讲解](https://www.youtube.com/watch?v=0VnOfu2pYTo)|
 |501|[Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree/#/description)| [Python [Yu]](./tree/Yu/501.py) | _O(N)_| _O(N)_  | Easy | |[公瑾讲解](https://youtu.be/v4F4x_uwMb8)|
+|257|[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/#/description)| [Python [Yu]](./tree/Yu/257.py) | _O(N)_| _O(N)_  | Easy | |[公瑾讲解](https://youtu.be/Zr_7qq2f16k)|
 |572|[Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/#/description)| [Python [Yu]](./tree/Yu/572.py) | _O(S*T)_| _O(1)_  | Easy | |[公瑾讲解](https://youtu.be/v4F4x_uwMb8)|
 |437|[Path Sum III](https://leetcode.com/problems/path-sum-iii/#/description)| [Python [Yu]](./tree/Yu/437.py) | _O(N^2)_| _O(1)_  | Easy | ||
 |404|[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/#/description)| [Python [Yu]](./tree/Yu/404_sum_of_Left_Leaves.py) | _O(N)_| _O(1)_  | Easy |
 |[公瑾讲解](https://youtu.be/pH-KxPcBF_4)|
-|101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/#/description)| [Python [Yu]](./tree/Yu/101_symmetricTree.py)| _O(N)_| _O(1)_  | Easy ||[公瑾讲解](https://youtu.be/3Gl4F29LVpQ)|
 |270|[Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/#/description)| [Python [Yu]](./tree/Yu/270)| _O(N)_| _O(1)_  | Easy ||[公瑾讲解](https://youtu.be/RwvQyKJxHZk)|
+|563|[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/#/description)| [Python [Yu]](./tree/Yu/563.py) | _O(N)_| _O(1)_  | Easy | |[公瑾讲解](https://youtu.be/47FQVP4ynk0)|
 
 
 
-
-|563|[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/#/description)| [Python [Yu]](./tree/Yu/563.py) | _O(N)_| _O(1)_  | Easy | |[公瑾讲解](https://youtu.be/47FQVP4ynk0)|
-|257|[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/#/description)| [Python [Yu]](./tree/Yu/257.py) | _O(N)_| _O(N)_  | Easy | |[公瑾讲解](https://youtu.be/Zr_7qq2f16k)|
+## Tree Medium
+|  #  | Title | Solution | Time | Space | Difficulty |Tag| Note|
+|-----|-------| -------- | ---- | ------|------------|---|-----|
 |102|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/#/description)| [Python [Yu]](./tree/Yu/102.py) | _O(N)_| _O(N)_  | Medium | |[公瑾讲解](https://youtu.be/IWiprpdSgzg)|
 |107|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/#/description)| [Python [Yu]](./tree/Yu/107.py) | _O(N)_| _O(N)_  | Medium | ||
 |515|[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/#/description)| [Python [Yu]](./tree/Yu/515.py) | _O(N)_| _O(1)_  | Medium | ||

tree/Yu/404_sum_of_Left_Leaves.py

@@ -1,3 +1,13 @@
+#!/usr/bin/python
+# -*- coding: utf-8 -*-
+
+# Author: Yu Zhou
+# 404 sumOfLeftLeaves
+
+# ****************
+# Descrption:
+# ****************
+
 class Solution(object):
     def sumOfLeftLeaves(self, root):
         """