Deletion in Binary Search Tree, python implementation [closed]

Question

Closed. This question needs details or clarity. It is not currently accepting answers.

Want to improve this question? As written, this question is lacking some of the information it needs to be answered. If the author adds details in comments, consider editing them into the question. Once there's sufficient detail to answer, vote to reopen the question.

Closed 11 years ago.

Improve this question

Implementation of the algorithm in Wiki article has a drawback. If the tree consists from only one root then nothing happen. The tree is not modified. How to fix this issue? In C++ it is possible to set root pointer to null, but what to do in python?

if the tree has only the root, then the root is a leaf, so you delete it. If you have an object with a reference to the root, you can set it to nothing. — Simon Bergot
– Simon Bergot, Commented May 9, 2014 at 20:33
@msh How are empty trees represented in your code? Because that is the result: An empty tree — Niklas B.
– Niklas B., Commented May 9, 2014 at 20:36
Python has None if you are trying to perform something similar to null in c++ — Farmer Joe
– Farmer Joe, Commented May 9, 2014 at 20:36
This is a continuation of a previous question, and the OP is looking to replace the value with None, but for all names that have that instance assigned to them - this is not possible in Python. — Gareth Latty
– Gareth Latty, Commented May 9, 2014 at 20:40

Community · Accepted Answer · 2017-05-23 12:13:11Z

2

This is a continuation of a previous question, and the OP is looking to replace the value with None, but for all names that have that instance assigned to them - this is not possible in Python.

The answer is there is no way to delete the value in this case due to the way Python is designed - you would have to implement an object manager of some kind, store it in a container and access it through that, or change your design not to rely on mutation.

Another question worth asking - is this a case that is likely to happen? It may be possible (and desirable) just to define this as a limitation where the root node can't be destroyed. I can't think of a case where you would want that functionality.

edited May 23, 2017 at 12:13

CommunityBot

11 silver badge

answered May 9, 2014 at 20:41

Gareth Latty

89.5k18 gold badges183 silver badges187 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Deletion in Binary Search Tree, python implementation [closed]

1 Answer 1

Comments

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Linked

Related