Update construct_binary_tree_from_preorder_and_inorder_traversal.py

yingl · web-flow · commit 738de29cc2c9 · 2017-04-25T18:40:16.000+08:00
diff --git a/construct_binary_tree_from_preorder_and_inorder_traversal.py b/construct_binary_tree_from_preorder_and_inorder_traversal.py
@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# coding: utf-8
 
 class Solution:
     """
@@ -24,4 +24,6 @@ def _buildTree(self, preorder, pre_start, pre_end, inorder, in_start, in_end):
         root.left = self._buildTree(preorder, pre_start + 1, pre_start +1 + left_len, inorder, in_start, i)
         # 生成右子树
         root.right = self._buildTree(preorder, pre_start + 1 + left_len, pre_end, inorder, i + 1, in_end)
-        return root
+        return root
+
+# medium: http://lintcode.com/zh-cn/problem/construct-binary-tree-from-preorder-and-inorder-traversal/
