insert, delete node, find operations in a binary tree

First of all i thought to write these operations in C.

insert and find were cute and simple. i was just going on like a kid picking chocolates on the road. suddenly when I’m in the middle of delete node operation (where i couldn’t find more chocolates). i looked at my back and there it was a perfectly creepy and scary cob web(consisting of count less *’s) . I almost cried like a kid and left all those chocolates and took my self a comfortable seat under C++ references. and then it was just a piece of cake. So here’s my piece of cake!

 

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s