What is the run time for a B tree, like for operations... Insert, Delete, Search and to get all the elements displayed...???

Question

anonymous · Answer

Guys is there anyone who could answer this??

anonymous · Answer

http://en.wikipedia.org/wiki/Binary_search_tree

anonymous · Answer

Don't be confused. There's actually a difference between a binary search tree and a B tree. http://en.wikipedia.org/wiki/B_tree. As you can see it runs in a logarithmic amortized time time. B trees are used commonly in storing databases, if I'm not mistaken.