Binary trees - deletion

Question

I basically need a way of guaranteed O(log n) deletion. Can this be done with a binary tree, or is it always worst case O(n)?

What if I balance the tree everytime?

please help

Answer 1

You need a balanced binary tree for the guarantee to work. Red Black Trees are an example of the balanced tree structure and the implementation is not too hard.

Red Black Trees (wiki)

And here is a nice lecture for that ..

Answer 2

If you are looking for a balanced binary tree, you could use the "heap"

http://en.wikipedia.org/wiki/Heap_(data_structure )

Answer 3

You need a Binary Search Tree

As the wiki page above said:

thus in the worst case it requires time proportional to the height of the tree

which means if you can make it always balanced, you can get O(logN) for deletion