添加二叉搜索树

TinySTL/BinarySearchTree.h

@@ -0,0 +1,15 @@
+#ifndef _BINARY_SEARCH_TREE_H_
+#define _BINARY_SEARCH_TREE_H_
+
+#include "Allocator.h"
+
+namespace TinySTL{
+	//class of binary_search_tree
+	template<class T, class Alloc = TinySTL::allocator<T>>
+	class binary_search_tree{};
+	//class of bst iterator
+	template<class T>
+	class bst_iter{};
+}
+
+#endif

TinySTL/TinySTL.vcxproj

@@ -86,6 +86,7 @@
     <ClInclude Include="Algorithm.h" />
     <ClInclude Include="Alloc.h" />
     <ClInclude Include="Allocator.h" />
+    <ClInclude Include="BinarySearchTree.h" />
     <ClInclude Include="Bitmap.h" />
     <ClInclude Include="CircularBuffer.h" />
     <ClInclude Include="Construct.h" />

TinySTL/TinySTL.vcxproj.filters

@@ -80,5 +80,8 @@
     <ClInclude Include="Utility.h">
       <Filter>头文件</Filter>
     </ClInclude>
+    <ClInclude Include="BinarySearchTree.h">
+      <Filter>头文件</Filter>
+    </ClInclude>
   </ItemGroup>
 </Project>