Removing Binary Tree Node!

[JoeAley2003]

Hi all...


I need an example of a

RemoveNodeFromBTree(Data or Pointer);

function or even an alghoritm will help.

Will i need to rearrange the tree after this procedure?



Thanks.

 

[Gianni Mariani]

Hi all...


I need an example of a

RemoveNodeFromBTree(Data or Pointer);

function or even an alghoritm will help.

Will i need to rearrange the tree after this procedure?

What are the balance requirements for the tree ?

 

[Ben Pfaff]

I need an example of a

RemoveNodeFromBTree(Data or Pointer);

function or even an alghoritm will help.

Two algorithms, with code, given here:
http://adtinfo.org/libavl.html/Deleting-from-a-BST.html
(In C, not C++.)

 

[Gianni Mariani]

If i understood you right, you may want to know that i used the
greater data to the right and the minor to the left.

Ben Plaff posted the url to a nice article.

The problem is not left or right it's about how you balance the tree to
optimize the search time. Look up AVL balanced binary trees.

 

[Ben Pfaff]

What are the balance requirements for the tree ?

Since he didn't mention that it's a balanced binary tree, it
probably isn't.