class BiTree
{
    public:
        BiTree();
        virtual ~BiTree();
        virtual void insertNode(Node * newNode);
        virtual void deleteNode(Node * delNode);
        virtual void searchNode(VALUETYPE value)
        {

        }

        virtual int getDepth();
        virtual int getWidth()
        {
            travelwide();
            return 0;
        }

        virtual void SetTreeDraw();
        friend ostream& operator << (ostream&,BiTree&);

    protected:

    private:
        Node * root=NULL;
        TreeDrawing mytreedraw;
        QQueue<Node> tempque;
        QQueue<Node> resultque;
        virtual void leftrotate(Node * mynode){}
        virtual void rightrotate(Node * mynode){}
        virtual void transplant(Node * oldnode, Node * newnode);
        virtual Node * tree_min(Node * mynode);
        virtual Node * tree_max(Node * mynode);
       // virtual QPoint GetNodesLocation(Node * curnode);
        virtual void print(Node * mynode);
        virtual int traveldeep(Node * node, int layer,int line);
        virtual void traveldeep(Node * node,void (* callback)(Node * node));
        virtual int travelwide();
};

相关文章:

  • 2022-12-23
  • 2021-11-30
  • 2021-09-13
  • 2021-12-28
猜你喜欢
  • 2021-08-07
  • 2022-02-07
  • 2021-07-10
  • 2021-12-01
  • 2021-09-07
  • 2021-05-31
  • 2021-09-27
相关资源
相似解决方案