Can anybody help me with deletion in a Binary Search Tree by pointer manipulation and not shifting the value. The tree is maintained in linked form.

each node is of type

struct node{
int info;
struct node *left,*right;
};

The program shouldn't use recursion.

Question

Can anybody help me with deletion in a Binary Search Tree by pointer manipulation and not shifting the value. The tree is maintained in linked form.

each node is of type

struct node{
int info;
struct node *left,*right;
};

The program shouldn't use recursion.

rsmith6559 · Answer

Draw a tree with about 4 levels and see what would happen if you wanted to remove a second or third level node.  Also note what happens to the balance of your tree.