To write in template class diagram of the recursive and non-recursive traversal C code-CodePudding

, come and look at save the children!

CodePudding user response:

Is there a big look at! Payment can also!

CodePudding user response:

Void tree (node * p) {
Cout<& lt; P - & gt; Data<& lt; endl;
If (p!=NULL) {
A tree (p - & gt; Left);
A tree (p - & gt; Right)
}
}

CodePudding user response:

  template 
Void tree (T * p) {
Cout<& lt; P - & gt; Data<& lt; endl; 
If (p!=NULL) {
A tree (p - & gt; Left); 
A tree (p - & gt; Right) 
} 
}

CodePudding user response:

 template 
Void tree (T * p) {
Cout<& lt; P - & gt; Data<& lt; endl; 
If (p!=NULL) {
A tree (p - & gt; Left); 
A tree (p - & gt; Right) 
} 
}