0
我遇到了实现Inorder遍历的麻烦。这是我的代码。这不工作吗?由于某种原因,我收到了段错误。请帮助C++ BST Inorder Trouble
BSTree.h
class BSTree {
public:
....
// void traverseInorder(Node* root);
private:
Node * root;
};
BSTree.cpp
void BSTree::inOrderPrint() {
root->traverseInorder(root);
}
Node.h
class Node {
public:
void traverseInorder(Node* root);
// void printInOrder(Node* root);
Node* returnLeft(Node* root);
Node* returnRight(Node* root);
void printC();
private:
Customer c;
Node* left;
Node* right;
};
Node.cpp
void Node::traverseInorder(Node* root){
if(root==NULL){
return;
}
if(root->left!= NULL){
traverseInorder(root->left);
}
printC();
if(right != NULL){
traverseInorder(root->right);
}
}
void Node::printC(){
cout<<c;
}
我< <有过多的
ostream& operator<<(ostream & os, Customer & c) {
os << c.getLastName() << ", " << c.getInitial() << ". " << "(" << c.getAccountBalance() << ")";
return os;
}