添加二叉搜索树
This commit is contained in:
15
TinySTL/BinarySearchTree.h
Normal file
15
TinySTL/BinarySearchTree.h
Normal file
@@ -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
|
||||
Reference in New Issue
Block a user