Search, Insert and Deletion. How those properties work in a Binary Tree? How much I read articles and all nothing worked, still I cannot understand it well. Please help me with this. I want to know it simply. On internet they have explained very complicatedly.
This is not a bad intro to unbalanced trees, with code samples in c and java:
And this is another reasonably good explanation with code samples in c++ (although they don't provide a remove implementation):
And finally, a very verbose article here (with remove implementation):