Talk:2–3 tree

This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computer science Mid‑importance This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles Mid This article has been rated as Mid-importance on the project's importance scale. Things you can help WikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

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 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)[reply]

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."

(E 3521 (talk) 06:07, 24 May 2010 (UTC))[reply]

The third example at the insertion section contains errors.How Si Yu (talk) 10:42, 8 November 2014 (UTC)[reply]

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 132.160.49.90 (talk) 20:34, 15 March 2016 (UTC)[reply]

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)[reply]

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.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).

• 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.

Cheers.—InternetArchiveBot (Report bug) 15:23, 22 June 2017 (UTC)[reply]

The operation for deletion is missing from the explanations of operations for a 2-3 tree, in the Operations section. Aceing_Winter_Snows_Harsh_Cold (talk) 04:58, 19 October 2018 (UTC)[reply]