This is an old revision of this page, as edited by DrWolfen(talk | contribs) at 01:56, 24 March 2012(added a question about full vs perfect k-ary trees). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Revision as of 01:56, 24 March 2012 by DrWolfen(talk | contribs)(added a question about full vs perfect k-ary trees)
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 articles
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.
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
For the equations about the total number of nodes and the height, is it for the upper bound maximum? Are those equations for a balanced tree? — Preceding unsigned comment added by 211.135.36.114 (talk) 09:32, 30 August 2011 (UTC)[reply]
For the part about full/complete/perfect k-ary trees, in my classes it was emphasized that there is a difference between a full k-ary tree and a perfect k-ary tree. However, some articles I read seem to deal with this differently, and the article I cited even said that the difference between the two is sometimes recognized, but other times both terms are used to mean the same thing. Should this be addressed in the article? --User:DrWolfen