这个功能是二叉树类二叉搜索树,错误的预定,不知道是什么错误
/***********************
*
* give preorder of tree
*
* ********************/
void preorder(Node * node, std::ostream &p_str){
if(node != NULL){
//p_str << node->Data() << " ";
if(node->m_ll) {
preorder(node->m_ll, &p_str);
}
if(node->m_rl) {
preorder(node->m_rl, &p_str);
}
}
}
这让来电来访类以外的内部。递归遍历树,从根
void preorder(Node * node, std::ostream &p_str){
if(node != NULL){
//p_str << node->Data() << " ";
if(node->m_ll) {
preorder(node->m_ll, &p_str);
}
if(node->m_rl) {
preorder(node->m_rl, &p_str);
}
}
}
我得到这样的错误
Tree.h:337: error: no matching function for call to 'CTree<int>::preorder(CTree<int>::Node*&, std::ostream*)'
Tree.h:330: note: candidates are: void CTree<T>::preorder(CTree<T>::Node*, std::ostream&) [with T = int]
Tree.h:343: error: no matching function for call to 'CTree<int>::preorder(CTree<int>::Node*&, std::ostream*)'
Tree.h:330: note: candidates are: void CTree<T>::preorder(CTree<T>::Node*, std::ostream&) [with T = int]
的我俯瞰的相当简单的事情,任何想法?
是的。那工作。 D'哦 – tausch86 2013-02-16 00:50:23