Ask your own question, for FREE!
Computer Science 7 Online
OpenStudy (anonymous):

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

OpenStudy (anonymous):

Guys is there anyone who could answer this??

OpenStudy (anonymous):

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

OpenStudy (anonymous):

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.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!