Update construct_binary_tree_from_inorder_and_postorder_traversal.py

yingl · web-flow · commit 4ca9300ce095 · 2017-04-25T18:40:54.000+08:00
diff --git a/construct_binary_tree_from_inorder_and_postorder_traversal.py b/construct_binary_tree_from_inorder_and_postorder_traversal.py
@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# coding: utf-8
 
 class Solution:
     """
@@ -22,4 +22,6 @@ def _buildTree(self, inorder, in_start, in_end, postorder, post_start, post_end)
         left_len = i - in_start # 左子树元素数量
         root.left = self._buildTree(inorder, in_start, i, postorder, post_start, post_start + left_len)
         root.right = self._buildTree(inorder, i + 1, in_end, postorder, post_start + left_len, post_end - 1)
-        return root
+        return root
+
+# medium: http://lintcode.com/zh-cn/problem/construct-binary-tree-from-inorder-and-postorder-traversal/
