Hi,
I have implemented a B-Tree(not binary tree)... Now the Deletion part.. there seem to be a lot of methods in deleting an element from a B-Tree and still keep the tree balanced... Which is the easiest method to implement...
And please explain the method you choose.. along with reason if you could...
Thanx
Vasanth
<edited by fordy>The question is in the wrong place, but have some self respect and dont use insults</edited by fordy>
Use the programming boards.
-Save the whales. Collect the whole set.
hey valar_king... i just realized you are from LA... what part?
I came up with a cool phrase to put down here, but i forgot it...
barksdale air force baseOriginally posted by ...
hey valar_king... i just realized you are from LA... what part?
-Save the whales. Collect the whole set.
Well.. There is no code here and it does not belong to any language section.. and so i think GD was right for this... there isnt any algorithm bord .. is there!!!!!. And this is a general computers related to an algorithm and that algorithm does not necessarily mean it is used in programming.. it can also be used in variuos other subjects....
Well o one has an answer to my question here...
And what is the noobie valar_king bragin about...
I think we need a General Programming board and a Comp. Science board.
