https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE250%3Alab-7%3Adcho040SE250:lab-7:dcho040 - Revision history2026-04-29T02:10:03ZRevision history for this page on the wikiMediaWiki 1.45.3https://wiki.kram.nz/index.php?title=SE250:lab-7:dcho040&diff=7528&oldid=prevMark: 1 revision(s)2008-11-03T05:20:14Z<p>1 revision(s)</p>
<p><b>New page</b></p><div>==discussion==<br />
it was easy lab and most stuff we already learn<br />
<br />
==task1==<br />
left: move to left node<br />
right: move to right node<br />
root: move to root<br />
<br />
==task2==<br />
<pre><br />
a<br />
b<br />
c<br />
d <br />
e<br />
f<br />
g<br />
This is only one way to balance in this case<br />
</pre><br />
<br />
==task3==<br />
<pre><br />
rotate right from task2<br />
a<br />
b<br />
c<br />
d (*)<br />
e<br />
f<br />
g<br />
<br />
print<br />
Tree[a,b,c,*d*,e,f,g]<br />
<br />
tree is rotated but print shows the same results<br />
because print show preorder which shows from small to big<br />
</pre><br />
<br />
==task4==<br />
right rotation : right node goes to parent of the node selected<br />
and that parent's left node goes to the right position of the node selected<br />
left rotation : opposite<br />
<br />
==task5==<br />
repeat 'root' and 'rotate left'<br />
<br />
==task6==<br />
rotate left<br />
root<br />
rotate left<br />
root<br />
rotate left<br />
rotate right<br />
root<br />
right<br />
rotate left<br />
<br />
==task7==<br />
a<br />
b<br />
c<br />
d<br />
e<br />
f<br />
g (*)<br />
h<br />
i<br />
<br />
rotate left<br />
<br />
a<br />
b<br />
c<br />
d<br />
e<br />
f<br />
g (*)<br />
h<br />
i<br />
<br />
done<br />
<br />
==task8==<br />
I think it's possible it's balanced before insert or delete<br />
and shold check rotating the node from leaf to roof because before reach the leaf we don't know we need rotating or not</div>Mark