Deleting a node from a binary tree

[A]

Hi,

I'm trying to solve the 3rd and final case in deleting a node from a binary
tree. That is, deleting a node that has two subtrees. If someone out there
who knows about this problem as they have done it before or is currently
doing something similar then please give me some links with code.
Regards,
dfgf
---
Outgoing mail is certified Virus Free.
Checked by AVG anti-virus system (http://www.grisoft.com).
Version: 6.0.518 / Virus Database: 316 - Release Date: 11/09/2003

[Victor Bazarov]

"A" <[e-mail]> wrote...

I'm trying to solve the 3rd and final case in deleting a node from a binary tree. That is, deleting a node that has two subtrees. If someone out there
who knows about this problem as they have done it before or is currently
doing something similar then please give me some links with code.

What does this problem have to do with the C++ language? If you in the
future encounter a generic programming problem like this, please consider
posting to comp.programming. If you have a problem that involves some
C++ _code_, post the code. For more advice please read FAQ section 5.

Victor

[Karl Heinz Buchegger]

A wrote:

Hi,

I'm trying to solve the 3rd and final case in deleting a node from a binary
tree. That is, deleting a node that has two subtrees. If someone out there
who knows about this problem as they have done it before or is currently
doing something similar then please give me some links with code.

(I assume a BST, otherwise the whole thing is trivial :-)

Where is the problem?
Every textbook on algorithms knows the solution:

search for the largest node in the left subtree ...
(basically: 1 times down left then all the way down
right until you reach the leaf)
... disconnect that node and reconnect it as new root node

--
Karl Heinz Buchegger
kb******@gascad.at

[Jerry Coffin]

In article <3f**********@news.iprimus.com.au>, [e-mail] says...

Hi,

I'm trying to solve the 3rd and final case in deleting a node from a binary
tree. That is, deleting a node that has two subtrees. If someone out there
who knows about this problem as they have done it before or is currently
doing something similar then please give me some links with code.

Find the largest node in the left sub-tree or the smallest node in the
right sub-tree, and substitute that node into the place of the node
being deleted.

--
Later,
Jerry.

The universe is a figment of its own imagination.