Method buildTree

Trees/delete_nodes_BST.cpp:31–53

builds a Binary Tree taking (int) value as an argument and returns the root to the tree built.

    //builds a Binary Tree taking (int) value as an argument and returns the root to the tree built. 
    Tree* buildTree(int val)
    {
        if(this==nullptr)
        {
            Tree *temp = new Tree(val);
            return temp;
        }
        else
        {
            Tree *temp=nullptr;
            if(this->val>val)
            {
                temp=this->left->buildTree(val);
                this->left=temp;
            }
            else
            {
                temp=this->right->buildTree(val);
                this->right=temp;
            }
            return this;
        }
    }
    
    //RECURSIVE DFS PREORDER
    void preOrder()