Binary Tree Interface

    BinaryTree();
    BinaryTree(const T& value);
    BinaryTree(const BinaryTree<T>& lf, const BinaryTree<T>& rt);
    BinaryTree(const T& value, const BinaryTree<T>& lf,
        const BinaryTree<T>& rt);
    BinaryTree(const BinaryTree<T>& tree);

    ~BinaryTree();

    int Size() const;
    int Height() const;
    bool Empty() const;
    T& Root() const;
    BinaryTree<T> LeftSubtree() const;
    BinaryTree<T> RightSubtree() const;
    bool IsCountBalanced() const;
    bool IsHeightBalanced() const;

    void MakeEmpty();
    void SetRoot(const T& value);

    bool Equal(BinaryTree<T> tree) const;
    void Input(istream& in);
    void Output(ostream& out) const;

    BinaryTree<T>& operator=(const BinaryTree<T>& tree);

    void PreorderTraversal(void (* Visit) (BinaryTreeNode<T>*)) const;
    void InorderTraversal(void (* Visit) (BinaryTreeNode<T>*)) const;
    void PostorderTraversal(void (* Visit) (BinaryTreeNode<T>*)) const;
    void LevelorderTraversal(void (* Visit) (BinaryTreeNode<T>*)) const;

    T* Search(const T& value) const;
    void Draw() const;