Talk:Self-balancing binary search tree: Difference between revisions

Revision as of 02:27, 11 August 2009

Revision as of 21:30, 16 December 2009

Line 20:

I appreciate the work that went into typing the proof of the minimum tree height. That proof would be fine in a textbook, but unfortunately Wikpedia is not a textbook; its articles are not supposed to include proofs, over-justify statements, or over-explain examples. Sorry, and all the best, --[[User:Jorge Stolfi|Jorge Stolfi]] ([[User talk:Jorge Stolfi|talk]]) 02:27, 11 August 2009 (UTC)

== Is a splay height balanced? ==

In the first part of this article it reads: "a self-balancing (or height-balanced) binary search tree is any binary search tree data structure that automatically keeps its height" a splay tree is listed in this article as a tree that fits this description. however I do not believe that a splay tree is height balanced. I'm new to this so maybe someone whos better ith this topic could clarify, I'm just studying for a test :P [[User:DriverChief|DriverChief]] ([[User talk:DriverChief|talk]]) 21:30, 16 December 2009 (UTC)