Talk:Dancing tree

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

Computing This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology 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.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing ??? This article has not yet received a rating on the project's importance scale. This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the |auto= parameter.

Topic of this article has nothing to do with ents, right? --Damian Yerrick (talk | stalk) 21:08, 5 February 2007 (UTC)[reply]

Or perhaps this one. --j.engelh 13:55, 7 February 2007 (UTC)[reply]

No. Kasperd (talk) 15:52, 2 March 2008 (UTC)[reply]

Has there been done any research in dancing trees other than what Hans Reiser and Namesys has done? Are there any scientific papers referring Reiser's work in this area? Dancing trees may be a good idea, but Reiser's approach seem very heuristic. Would be nice to see some actual analysis of when and why it is a good algorithm. Kasperd (talk) 15:52, 2 March 2008 (UTC)[reply]

The article claims that dancing trees are a tree data structure, while failing to define it as such. As a matter of fact, it only talks about issues surrounding its implementation. —Preceding unsigned comment added by 129.132.146.66 (talk) 13:23, 23 April 2008 (UTC)[reply]