Jump to content

Talk:Self-balancing binary search tree

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Dcoetzee (talk | contribs) at 03:32, 7 December 2007 (→Implementations). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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! Deco 02:41, 6 Apr 2005 (UTC)

Ordered lists

The link to ordered lists goes to a page about HTML markup!

Presumably there's a better destination for it... does anyone know of one? 84.9.75.24 (talk) 11:00, 27 November 2007 (UTC)[reply]

Implementations

That section should mention the differences between the various algorithms, which ones are good, which ones aren't, and which perform better in certain situations. Shinobu (talk) 03:14, 7 December 2007 (UTC)[reply]

Good idea, this is an appropriate article for comparison. Dcoetzee 03:32, 7 December 2007 (UTC)[reply]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Self-balancing_binary_search_tree&oldid=176297730"