void BST::realInsert(Node * node,int val) { if(node->data>val) { if(node->left==nullptr) node->left=new Node(val); else realInsert(node->left,val); } else if(node->data<val) { if(node->right==nullptr) node->right=new Node(val); else realInsert(node->right,val); } }
void InsertSort::run(int *array, int size) { realInsert(array, size); }
void BST::insert(int val) { if(root==nullptr)root=new Node(val); realInsert(root,val); }