Talk:Self-balancing binary search tree: Difference between revisions

Revision as of 03:42, 12 March 2012

Revision as of 22:46, 3 June 2013

Line 5:

Is a B-Tree a binary tree? Doesn't a binary tree only allow two connections from it, while a B-Tree can have a lot more.

:A B-tree is certainly not a binary tree. I have no idea when that link snuck in. Away with it! [[User:Dcoetzee|Deco]] 02:41, 6 Apr 2005 (UTC)

==overview==

The overview states that

(log-base2(n+1) - 1) >= log-base2(n)

How can this be? Am I missing something? Seems to me it should be less than or equal, not greater than or equal.

E.g., if n=1 (no children), then log-base2(1 + 1) - 1 = 0 = log-base2(1) ... so in that case they are equal.

But in any other case, the left hand side is smaller. E.g., let's say n=7:

log-base2(7+1) - 1 = 2 < log-base2(7)

Right??

[[User:this.is.mvw|Mike Williamson]] 2013/6/3

== Ordered lists ==