update doc

stevencooks · stevencooks · commit 836b42709643 · 2015-09-26T17:47:16.000-04:00
diff --git a/README.md b/README.md
@@ -11,8 +11,9 @@ Selected problems that are included in LintCode but are not included in Leetcode
 
 | problem | solution | tags | note |
 | --- | ---- | ---------| ----- |
-| 03.01 | [Insert Node in Binary Search Tree](https://github.com/interviewcoder/lintcode/blob/master/03_binarytree%26divideconquer/_01_InsertNodeInABinarySearchTree/Solution.java) | BST `LintCode Copyright` | |
+| 03.01 | [Insert Node in Binary Search Tree](https://github.com/interviewcoder/lintcode/blob/master/03_binarytree%26divideconquer/_01_InsertNodeInABinarySearchTree/Solution.java) | Binary Search Tree | |
 | 03.02 | [Search Range In Binary Search Tree](https://github.com/interviewcoder/lintcode/blob/master/03_binarytree%26divideconquer/_02_SearchRangeInBinarySearchTree/Solution.java) | Binary Search Tree | in-order + pruning |
 | 04.01 | [Longest Increasing Subsequence](https://github.com/interviewcoder/lintcode/blob/master/04_dynamicprogrammingI/_01_LongestIncreasingSubsequence/Solution.java) | Dynamic Programming | |
 | 05.01 | [Longest Common Substring](https://github.com/interviewcoder/lintcode/blob/master/05_dynamicprogrammingII/_01_LongestCommonSubstring/Solution.java) | Dynamic Programming | |
-| 05.02 | [Longest Common Subsequence](https://github.com/interviewcoder/lintcode/blob/master/05_dynamicprogrammingII/_02_LongestCommonSubsequence/Solution.java) | Dynamic Programming | |
+| 05.02 | [Longest Common Subsequence](https://github.com/interviewcoder/lintcode/blob/master/05_dynamicprogrammingII/_02_LongestCommonSubsequence/Solution.java) | Dynamic Programming | |
+| 07.01 | [Topological Sort](https://github.com/interviewcoder/lintcode/tree/master/07_graph%26search/_01_TopologicalSorting) | Topological Sort | |
