https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE250%3Alab-7%3Ajsmi233SE250:lab-7:jsmi233 - Revision history2026-04-30T20:16:20ZRevision history for this page on the wikiMediaWiki 1.45.3https://wiki.kram.nz/index.php?title=SE250:lab-7:jsmi233&diff=7649&oldid=prevMark: 2 revision(s)2008-11-03T05:20:16Z<p>2 revision(s)</p>
<p><b>New page</b></p><div>== Playing with balanced binary search tree's ==<br />
<br />
I inserted the words 'hello' 'world' 'from' 'a' 'binary' 'search' 'tree'<br />
<br />
The resulting tree:<br />
<br />
--a<br />
<br />
---binary<br />
<br />
-from<br />
<br />
hello<br />
<br />
--search<br />
<br />
---tree<br />
<br />
-world<br />
<br />
<br />
== Random lol interlude == <br />
<br />
Lolz!!!!!!!!!!!!!!!!!!!!!!!!!!!<br />
<br />
Clear tree = crash!!!!!!!!!<br />
<br />
Teh code failz!!!!!!!!!!!!!!<br />
<br />
<br />
== Back to work ==<br />
<br />
Inserting the elements dbacfeg in any order will result in a balanced tree provided the following conditions are met: 'd' comes first, 'b' comes before 'a' and 'c', and 'f' comes before 'e' and 'g'. The reason for these conditions is that a parent must be inserted before its children. I estimate that there are fifty six different insertion combinations that result in a balanced tree.<br />
<br />
<br />
Starting from a right skew, repeatedly use "rotate left" and then "root" to bring the tree into a left skew format.<br />
<br />
<br />
Starting from a right skew, use the following combination of commands to balance the tree:<br />
<br />
-{Rotate left, parent} three times<br />
<br />
-left, rotate right, parent<br />
<br />
-right, rotate left, parent<br />
<br />
<br />
From a balanced tree (seven elements), if two more elements (greater than all current elements) are added to the tree, then the tree can be rebalanced with the commands: right, right, rotate left.</div>Mark