408/912-notes
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

add iterative post-traversal algorithm, tests passed.

Browse Source
This commit is contained in:
Shine wOng
2019-05-27 16:52:16 +08:00
parent 6f1f6d5af3
commit fd26fbb550
2 changed files with 28 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
thu_dsa/chp5/binNode.h
View File

@@ -12,6 +12,7 @@ protected:
template <typename VST>
void visitAlongLeftBranch(VST &visit, Stack<BinNodePosi(T)> &S);
void goAlongLeftBranch(Stack<BinNodePosi(T)> &S);
void goToHLVFL(Stack<BinNodePosi(T)> &S); //Highest Leaf Visible From Left
public:
BinNodePosi(T) parent;
@@ -63,6 +64,19 @@ void BinNode<T>::goAlongLeftBranch(Stack<BinNodePosi(T)> &S){
}
}
template <typename T>
void BinNode<T>::goToHLVFL(Stack<BinNodePosi(T)> &S){
BinNodePosi(T) curr;
while(curr = S.top()){
if(curr->leftChild){
if (curr->rightChild) S.push(curr->rightChild);
S.push(curr->leftChild);
}
else S.push(curr->rightChild);
}
S.pop();
}
//public interfaces
template <typename T>
@@ -151,6 +165,18 @@ void BinNode<T>::postOrder_Re(VST &visit){
visit(this->data);
}
template <typename T> template <typename VST>
void BinNode<T>::postOrder_It(VST &visit){
Stack<BinNodePosi(T)> S;
BinNodePosi(T) curr = this;
S.push(curr);
while(!S.empty()){
if(S.top() != curr->parent) goToHLVFL(S);
curr = S.pop();
visit(curr->data);
}
}
template <typename T> template <typename VST>
void BinNode<T>::levelOrder(VST &visit){
Queue<BinNodePosi(T)> q;

2
thu_dsa/chp5/testBinTree.cpp
View File

@@ -130,6 +130,8 @@ void test_postTraversal(){
root->postOrder_Re(Print<int>());
cout << endl;
root->postOrder_It(Print<int>());
cout << endl;
}
void test_levelTraversal(){