feat: 0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal

Author: kimi0230

Leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/README.md

@@ -10,7 +10,7 @@ description: "0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal"
 license: ""
 images: []
 
-tags: [LeetCode, Go, Medium, Construct Binary Tree from Preorder and Inorder Traversal]
+tags: [LeetCode, Go, Medium, Construct Binary Tree from Preorder and Inorder Traversal, Array,Hash Table,Divide and Conquer,Tree, Binary Tree]
 categories: [LeetCode]
 
 featuredImage: ""
@@ -68,8 +68,13 @@ seo:
 ## 解題思路
 
 ## Big O
-時間複雜 : ``
-空間複雜 : ``
+* 時間複雜 : `O(n)`
+n個樹節點
+
+* 空間複雜 : `O(n)`
+遞迴調用的Stack空間是 O(h)，其中 h 是樹的高度。
+在每個遞迴層級中，都創建了一個 TreeNode 對象，因此空間複雜度也是 O(n)，其中 n 是節點的數量。 
+h< n所以空間複雜為 O(n)
 
 ## 來源
 * https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/

README.md

@@ -408,13 +408,14 @@ int binarySearch(int[] nums, int target){
 ---
 
 #### Tree
-| No.                                                                                           |                                                  Title                                                   |                                                Solution                                                 | Difficulty | Time | Space           | Topic     |
-|-----------------------------------------------------------------------------------------------|:--------------------------------------------------------------------------------------------------------:|:-------------------------------------------------------------------------------------------------------:|------------|------|-----------------|-----------|
-| [0226](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0226.Invert-Binary-Tree)            |                 [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)                  |      [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0226.Invert-Binary-Tree)      | Easy       | O(n) | O(1)            | Tree      |
-| [0104](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0104.Maximum-Depth-of-Binary-Tree/) | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree//description/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0104.Maximum-Depth-of-Binary-Tree) | Easy       | O(n) | O(1)            | Tree      |
-| [0543](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0543.Diameter-of-Binary-Tree)       |            [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/)             |   [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0543.Diameter-of-Binary-Tree)    | Easy       | O(n) | O(n), O(log(n)) | Tree, DFS |
-| [0110](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0110.Balanced-Binary-Tree)          |               [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/)                |     [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0110.Balanced-Binary-Tree)     | Easy       | O(n) | O(1)            | Tree, DFS |
-| [0100](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0100.Same-Tree)                     |                          [Same Tree](https://leetcode.com/problems/same-tree/)                           |          [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0100.Same-Tree)           | Easy       | O(n) | O(1)            | Tree      |
+| No.                                                                                                                       |                                                                               Title                                                                               |                                                               Solution                                                               | Difficulty | Time | Space           | Topic     |
+|---------------------------------------------------------------------------------------------------------------------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------:|:------------------------------------------------------------------------------------------------------------------------------------:|------------|------|-----------------|-----------|
+| [0226](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0226.Invert-Binary-Tree)                                        |                                              [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)                                              |                    [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0226.Invert-Binary-Tree)                     | Easy       | O(n) | O(1)            | Tree      |
+| [0104](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0104.Maximum-Depth-of-Binary-Tree/)                             |                             [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree//description/)                              |               [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0104.Maximum-Depth-of-Binary-Tree)                | Easy       | O(n) | O(1)            | Tree      |
+| [0543](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0543.Diameter-of-Binary-Tree)                                   |                                         [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/)                                         |                  [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0543.Diameter-of-Binary-Tree)                  | Easy       | O(n) | O(n), O(log(n)) | Tree, DFS |
+| [0110](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0110.Balanced-Binary-Tree)                                      |                                            [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/)                                            |                   [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0110.Balanced-Binary-Tree)                    | Easy       | O(n) | O(1)            | Tree, DFS |
+| [0100](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0100.Same-Tree)                                                 |                                                       [Same Tree](https://leetcode.com/problems/same-tree/)                                                       |                         [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0100.Same-Tree)                         | Easy       | O(n) | O(1)            | Tree      |
+| [0105](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal) | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal) | Medium     | O(n) | O(n)            | Array     |
 
 ---