diff --git a/README.md b/README.md index 48fca184..b14c2bf4 100644 --- a/README.md +++ b/README.md @@ -171,7 +171,7 @@ | 0102 | Binary Tree Level Order Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0102.%20Binary%20Tree%20Level%20Order%20Traversal) | 48.90% | Medium | | | 0103 | Binary Tree Zigzag Level Order Traversal | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal) | 42.10% | Medium | | | 0104 | Maximum Depth of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0104.%20Maximum%20Depth%20of%20Binary%20Tree) | 60.90% | Easy | | -| 0105 | Construct Binary Tree from Preorder and Inorder Traversal | | 41.60% | Medium | | +| 0105 | Construct Binary Tree from Preorder and Inorder Traversal |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal) | 41.60% | Medium | | | 0106 | Construct Binary Tree from Inorder and Postorder Traversal | | 39.70% | Medium | | | 0107 | Binary Tree Level Order Traversal II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0107.%20Binary%20Tree%20Level%20Order%20Traversal%20II) | 47.20% | Easy | | | 0108 | Convert Sorted Array to Binary Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree) | 51.20% | Easy | |