添加注释
This commit is contained in:
@@ -45,7 +45,7 @@ namespace TinySTL{
|
||||
void insert(const T& val);
|
||||
template<class Iterator>
|
||||
void insert(Iterator first, Iterator last);
|
||||
void erase(const T& val);//todo
|
||||
void erase(const T& val);
|
||||
|
||||
size_t height()const{ return getHeight(root_); }
|
||||
size_t size()const{ return size_; }
|
||||
|
||||
@@ -87,7 +87,7 @@ namespace TinySTL{
|
||||
};//end of bst class
|
||||
template<class T>
|
||||
size_t binary_search_tree<T>::height_aux(node *p)const{
|
||||
TinySTL::queue<node *> q, level;
|
||||
TinySTL::queue<node *> q/*<2A><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD>node*/, level/*<2A><><EFBFBD>ŵ<EFBFBD>ǰ<EFBFBD><C7B0><EFBFBD><EFBFBD>node*/;
|
||||
size_t nlevel = 0;
|
||||
if (p != 0){
|
||||
level.push(p);
|
||||
@@ -95,7 +95,7 @@ namespace TinySTL{
|
||||
while (!(q.empty() && level.empty())){
|
||||
if (level.empty()){
|
||||
++nlevel;
|
||||
while (!q.empty()){
|
||||
while (!q.empty()){//<2F><>ǰ<EFBFBD><C7B0>Ϊ<EFBFBD>գ<EFBFBD><D5A3><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD>nodeȫ<65><C8AB>ת<EFBFBD><D7AA><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ǰ<EFBFBD><C7B0>
|
||||
level.push(q.front());
|
||||
q.pop();
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user