Update binary_tree_level_order_traversal_ii.py

yingl · web-flow · commit 8eb1e9e25104 · 2017-04-25T18:46:58.000+08:00
diff --git a/binary_tree_level_order_traversal_ii.py b/binary_tree_level_order_traversal_ii.py
@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# coding: utf-8
 
 class Solution:
     """
@@ -22,4 +22,6 @@ def levelOrderBottom(self, root):
                     new_level.append(node.right)
             level = new_level
         ret.reverse() # 反转二叉树的层次遍历
-        return ret
+        return ret
+
+# medium: http://lintcode.com/zh-cn/problem/binary-tree-level-order-traversal-ii/
