Merge pull request #507 from openset/develop

Add: tag

Author: Shuo

tag/README.md

@@ -27,5 +27,4 @@
 | 31 | [Topological Sort](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md) | [拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md) | | 32 | [Brainteaser](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md) | [脑筋急转弯](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md) | 
 | 33 | [Geometry](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md) | [几何](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md) | | 34 | [Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md) | [](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md) | 
 | 35 | [Rejection Sampling](https://github.com/openset/leetcode/tree/master/tag/rejection-sampling/README.md) | [](https://github.com/openset/leetcode/tree/master/tag/rejection-sampling/README.md) | | 36 | [Reservoir Sampling](https://github.com/openset/leetcode/tree/master/tag/reservoir-sampling/README.md) | [蓄水池抽样](https://github.com/openset/leetcode/tree/master/tag/reservoir-sampling/README.md) | 
-| 37 | [Memoization](https://github.com/openset/leetcode/tree/master/tag/memoization/README.md) | [记忆化](https://github.com/openset/leetcode/tree/master/tag/memoization/README.md) | | 38 | [Binary Search Tree](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md) | [二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md) | 
-| 39 | [Map](https://github.com/openset/leetcode/tree/master/tag/map/README.md) | [](https://github.com/openset/leetcode/tree/master/tag/map/README.md) | 
+| 37 | [Memoization](https://github.com/openset/leetcode/tree/master/tag/memoization/README.md) | [记忆化](https://github.com/openset/leetcode/tree/master/tag/memoization/README.md) | 

tag/binary-search-tree/README.md

@@ -9,3 +9,18 @@
 
 | # | 题名 | 标签 | 难度 |
 | :-: | - | - | :-: |
+| 975 | [奇偶跳](https://github.com/openset/leetcode/tree/master/problems/odd-even-jump) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Hard |
+| 938 | [二叉搜索树的范围和](https://github.com/openset/leetcode/tree/master/problems/range-sum-of-bst) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]  | Medium |
+| 783 | [二叉搜索树结点最小距离](https://github.com/openset/leetcode/tree/master/problems/minimum-distance-between-bst-nodes) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]  | Easy |
+| 776 | [Split BST](https://github.com/openset/leetcode/tree/master/problems/split-bst) 🔒 | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]  | Medium |
+| 732 | [我的日程安排表 III](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]  | Hard |
+| 731 | [我的日程安排表 II](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Medium |
+| 715 | [Range 模块](https://github.com/openset/leetcode/tree/master/problems/range-module) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Hard |
+| 699 | [掉落的方块](https://github.com/openset/leetcode/tree/master/problems/falling-squares) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]  | Hard |
+| 683 | [K Empty Slots](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots) 🔒 | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Hard |
+| 530 | [二叉搜索树的最小绝对差](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]  | Easy |
+| 493 | [翻转对](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)]  | Hard |
+| 352 | [将数据流变为多个不相交区间](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]  | Hard |
+| 327 | [区间和的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)]  | Hard |
+| 315 | [计算右侧小于当前元素的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)]  | Hard |
+| 220 | [存在重复元素 III](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)]  | Medium |

tag/map/README.md

@@ -9,3 +9,5 @@
 
 | # | 题名 | 标签 | 难度 |
 | :-: | - | - | :-: |
+| 855 | [考场就座](https://github.com/openset/leetcode/tree/master/problems/exam-room) | [[Map](https://github.com/openset/leetcode/tree/master/tag/map/README.md)]  | Medium |
+| 846 | [一手顺子](https://github.com/openset/leetcode/tree/master/problems/hand-of-straights) | [[Map](https://github.com/openset/leetcode/tree/master/tag/map/README.md)]  | Medium |

tag/tags.json

@@ -183,15 +183,5 @@
 		"Name": "Memoization",
 		"Slug": "memoization",
 		"TranslatedName": "记忆化"
-	},
-	{
-		"Name": "Binary Search Tree",
-		"Slug": "binary-search-tree",
-		"TranslatedName": "二叉搜索树"
-	},
-	{
-		"Name": "Map",
-		"Slug": "map",
-		"TranslatedName": ""
 	}
 ]