BST deletion problem

#1

Whats going wrong in my code??

#2

hi @sounakume
your code is corect
but there is one small error

if you make newRoot (newR) then you have to pass it don’t use previous root
instead of that better way is to use only root in this fashion

for (int i = 0; i < m; i++)
{
  root = deleteNodeGiven(root, arr[i]);
}
// BFS(root);
preOrder(root);
#3

thank you , i got it

1 Like