Ask your own question, for FREE!
Computer Science 30 Online
OpenStudy (anonymous):

How do you remove an entry in a binary search tree with recursion?

OpenStudy (anonymous):

Well, first you have to find the element, then you have the parent can remove it. It'd help to know what language you're talking about and what the tree data is like.

OpenStudy (rsmith6559):

You recurse to the node. Finding it is the base case. Deleting and checking and rebalancing after the deletion would be before unwinding, which would primarily be returning a success code.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!