|WikiProject Computer science||(Rated Stub-class, Mid-importance)|
This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details. (September 2010) (Learn how and when to remove this template message)
This page must be corrected. The illustrations at the top contradict the definition given. Students in my class go to pages like this, and it must be corrected immediately. Vegasprof (talk) 13:02, 16 October 2008 (UTC)
According to notes in "Introduction to algorithms" by Cormen (B-Trees chapter), 2-3 Trees are not B-Trees. I also found this article: http://cs.engr.uky.edu/~lewis/essays/algorithms/2-3trees/trees2-3.html ("2-3 Trees as Search Trees")
2-3 Trees have been introduced in 1970 by J.E. Hopcroft. B-Trees have appeared later in 1972 (R. Bayer and E.M. McCreight "Organization and maintenance of large ordered indexes")
B and 2-3 are so different. For example, B-Trees include data in non-leaf nodes, but 2-3 only in leaves. In B-Trees terms, tree's degree must be >= 2 -- 2-3 are trees of degree equal to 1.
If I'm right, there is incorrect information on "B-tree" page (Overview section): "For example, in a 2-3 B-tree (often simply referred to as a 2-3 tree), each internal node may have only 2 or 3 child nodes."
You are confusing B trees with B+ trees. In a B+ tree, the data is stored in the leaves. In a B tree the data is stored in the internal nodes. B trees are generalizations of 2-3 trees, and you can also have 2-3 B+ trees. Go back and read again. This has been firmly established in Computer Science for a long time now. — Preceding unsigned comment added by 184.108.40.206 (talk) 20:34, 15 March 2016 (UTC)
Error in Definitions
The Definitions section only allow internal nodes in a 2-3 tree. It seems that instead of "L, M, and R are non-empty 2–3 trees of equal height" one should allow, L,M, and R to be empty, or perhaps a similar approach. Haskellelephant (talk) 20:36, 17 February 2017 (UTC)
Hello fellow Wikipedians,
I have just modified one external link on 2–3 tree. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
- Added archive https://web.archive.org/web/20081220033211/http://www.cosc.canterbury.ac.nz/mukundan/dsal/TwoThreeTree.html to http://www.cosc.canterbury.ac.nz/mukundan/dsal/TwoThreeTree.html
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
You may set the
|checked=, on this template, to true or failed to let other editors know you reviewed the change. If you find any errors, please use the tools below to fix them or call an editor by setting
|needhelp= to your help request.
- If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
- If you found an error with any archives or the URLs themselves, you can fix them with this tool.
If you are unable to use these tools, you may set
|needhelp=<your help request> on this template to request help from an experienced user. Please include details about your problem, to help other editors.