steven/TinySTL
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

添加层序遍历

Browse Source
This commit is contained in:
邹晓航
2014-10-18 15:49:27 +08:00
parent 3dc3730167
commit e09342a3da
1 changed files with 17 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
TinySTL/BinarySearchTree.h
View File

@@ -5,6 +5,7 @@
#include "Stack.h"
#include "String.h"
#include <deque>
#include <set>
namespace TinySTL{
@@ -60,6 +61,7 @@ namespace TinySTL{
void print_preorder(const string& delim = " ", std::ostream& os = std::cout)const;
void print_inorder(const string& delim = " ", std::ostream& os = std::cout)const;
void print_postorder(const string& delim = " ", std::ostream& os = std::cout)const;
void print_levelorder(const string& delim = " ", std::ostream& os = std::cout)const;
private:
void deallocateAllNodes(node *ptr){
if (ptr){
@@ -137,6 +139,21 @@ namespace TinySTL{
insert(*first);
}
template<class T>
void binary_search_tree<T>::print_levelorder(const string& delim, std::ostream& os)const{
auto temp = root_;
if (temp != 0){
std::deque<node *> q;
q.push_back(temp);
while (!q.empty()){
temp = q.front();
q.pop_front();
if (temp->left_ != 0) q.push_back(temp->left_);
if (temp->right_ != 0) q.push_back(temp->right_);
os << temp->data_ << delim;
}
}
}
template<class T>
void binary_search_tree<T>::print_preorder_aux(const string& delim, std::ostream& os, const node *ptr)const{
if (ptr){
os << ptr->data_ << delim;