Add: bug fixed

Author: openset

internal/leetcode/question_data.go

@@ -36,9 +36,8 @@ func QuestionData(titleSlug string, isForce bool, graphQL ...string) (qd questio
 		filePutContents(filename, jsonEncode(qd))
 	}
 	if qd.Data.Question.TitleSlug == "" {
-		os.Remove(filename)
 		if graphQL[0] == graphQLCnUrl {
-			return QuestionData(titleSlug, isForce, graphQLUrl)
+			return QuestionData(titleSlug, true, graphQLUrl)
 		}
 		for _, err := range qd.Errors {
 			log.Println(titleSlug, err.Message)

problems/construct-binary-tree-from-inorder-and-postorder-traversal/README.md

@@ -33,9 +33,9 @@ postorder = [9,15,7,20,3]</pre>
 </pre>
 
 ### Related Topics
-  [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]
   [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)]
   [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]
+  [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]
 
 ### Similar Questions
   1. [Construct Binary Tree from Preorder and Inorder Traversal](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-inorder-traversal) (Medium)

problems/construct-binary-tree-from-preorder-and-inorder-traversal/README.md

@@ -32,9 +32,9 @@ inorder = [9,3,15,20,7]</pre>
    15   7</pre>
 
 ### Related Topics
-  [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]
   [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)]
   [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]
+  [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]
 
 ### Similar Questions
   1. [Construct Binary Tree from Inorder and Postorder Traversal](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-inorder-and-postorder-traversal) (Medium)

problems/convert-sorted-list-to-binary-search-tree/README.md

@@ -30,8 +30,8 @@ One possible answer is: [0,-3,9,-10,null,5], which represents the following heig
 </pre>
 
 ### Related Topics
-  [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)]
   [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]
+  [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)]
 
 ### Similar Questions
   1. [Convert Sorted Array to Binary Search Tree](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-array-to-binary-search-tree) (Easy)