Wikipedia

Talk:Self-balancing binary search tree

This is an old revision of this page, as edited by 84.9.75.24 (talk) at 11:00, 27 November 2007 (→Ordered lists: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Latest comment: 17 years ago by 84.9.75.24 in topic Ordered lists
Learn more about this page

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

Latest comment: 17 years ago1 comment1 person in discussion

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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Self-balancing_binary_search_tree&oldid=174111793"