0

一个简单的二叉搜索树类声明：

#include <vector>
#include <stdio.h>

// Provides various structures utilized by search algorithms.

// Represents an generalized node with integer value and a set of children.
class Node {
protected:
    std::vector<Node*> children;
    int value;
public:
    //Creates a new instance of a Node with a default value=-1.
    Node(){value = -1;}
    //Creates a new instance of a Node with a specified value.
    explicit Node(int value){this->value = value;}
    virtual ~Node(){delete children;}

    //Adds new Node with specified value to the list of child nodes. Multiple
    //children with the same value are allowed.
    //Returns added node.
    virtual Node* Insert(int value);
    //Removes first occurrence of a Node with specified value among children.
    virtual void Remove(int value);
};

// Represents a binary search tree node with at most two children.
class BTNode: public Node {
public:
    //Creates a new instance of a BTNode with a default value=-1.
    BTNode():Node(){}
    //Creates a new instance of a BTNode with a specified value.
    explicit BTNode(int value):Node(value){}

    //Adds new BTNode with specified value to the list of child nodes in an
    //ordered manner, that is right child value is >= value of this node and
    //left child value < value of this node.
    virtual BTNode* Insert(int value);
    //Removes first occurrence of a Node with specified value from the tree.
    virtual void Remove(int value);
    //Returns a node with specified value.
    virtual BTNode* Search(int value);
};

eclipse 抱怨它的定义：

BTNode* BTNode::Search(int value){
    if (this->value == value) return *this;

    //Determines whether value is in left(0) or right(1) child.
    int child = this->value > value ? 0 : 1;
    if (children[child] != NULL)
        return children[child]->Search(value);

    return NULL;
}

呼叫发生的确切children[child]->Search(value)位置，并显示“方法搜索无法解析”消息。构建运行得很好（没有任何编译错误）。那有什么问题？

PS：还没有尝试运行代码。正在努力。

4

1 回答 1

2

Search是BTNode接口的一部分，但不是Nodes 接口的一部分，children是 avector的，因此调用aNode*是无效的。如果有一个方法是有意义的，那么添加它可以解决这个问题。如果不是，那么您需要重新考虑您的设计，这可能超出了这个问题的范围。SearchNode *NodeSearchNode

还有一些其他问题。你有：

virtual ~Node(){delete children;}

但children不是一个pointer它是一个std::vector<Node*>。您需要遍历vector并调用delete每个元素。在Search你有这个：

if (this->value == value) return *this;

但Search返回 aBTNode*所以它应该是：

if (this->value == value)  return this ;
于 2013-04-12T13:26:06.187 回答