c_cpp C ++中的二进制树，用于测试两个二叉树是否彼此相等。

Posted 2021-05-14

#include <iostream>

template<class T>
class BinaryNode {
public:
    BinaryNode(const T& val,
               BinaryNode<T>* left = nullptr,
               BinaryNode<T>* right = nullptr): _value(val), _left(left), _right(right)
    {
        
    }
    ~BinaryNode() {
        delete _left;
        delete _right;
    }
    
    const T& getValue(void) const {
        return _value;
    }
    
    
    void setRight(BinaryNode* node) {
        _right = node;
    }
    BinaryNode<T>* getRight(void) const {
        return _right;
    }
    void setLeft(BinaryNode* node) {
        _left = node;
    }
    BinaryNode<T>* getLeft(void) const {
        return _left;
    }
    
    bool operator==(const BinaryNode<T>& other) const {
        return _value == other.getValue() &&
               _left == other.getLeft() &&
               _right == other.getRight();
    }
private:
    T _value;
    BinaryNode<T>* _left;
    BinaryNode<T>* _right;
};

// To execute C++, please define "int main()"
int main(int argc, const char** argv) {
    BinaryNode<int>* a = new BinaryNode(3);
    BinaryNode<int>* b = new BinaryNode(3);
    BinaryNode<int>* c = new BinaryNode(6);
    b->setRight(c);
    a->setRight(c);
    std::cout << (*a == *b) << std::endl;
  return 0;
}