https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE250%3Alab-6%3Asgha014SE250:lab-6:sgha014 - Revision history2026-04-29T01:17:20ZRevision history for this page on the wikiMediaWiki 1.45.3https://wiki.kram.nz/index.php?title=SE250:lab-6:sgha014&diff=7335&oldid=prevMark: 14 revision(s)2008-11-03T05:20:09Z<p>14 revision(s)</p>
<p><b>New page</b></p><div>==task1==<br />
visual studio was stuffing up again...as usual...so then i tried using that cygwin thing...<br />
then kept getting errors....got help from mark and he was confused too...he said that for some reason it was running out of memory...so we compiled and ran it about 6 times and then for some reason it started working??? which was really weird...<br />
int heightOfTree;<br />
<br />
Node* node = makeRandomTree(7);<br />
heightOfTree = height(node);<br />
printf("height: %d", heightOfTree);<br />
also...whats the differnce between Node* node and Node *node ??? Mark said he didnt know either.<br />
<br />
i varied the siz from 0 to 300...went up in 5s<br />
<br />
[http://img59.imageshack.us/img59/1926/ssiz3.jpg graph]<br />
<br />
==task2==<br />
i started off using if statements then the tutor said that wont work and said we hav 2 use a loop<br />
Node* minimum( Node* node ) {<br />
/* TODO */<br />
while(node->left != empty){<br />
node = node->left;<br />
}<br />
return node;<br />
<br />
}<br />
<br />
Node* maximum( Node* node ) {<br />
/* TODO */<br />
while(node->right != empty){<br />
node = node->right;<br />
}<br />
return node;<br />
}<br />
<br />
i got the minimum and maximum for a tree of size 100 and got a min of 41 and a max of 32757<br />
<br />
==task3==<br />
i was abit unsure about this task at first and it took a while for me to get it.<br />
but in the end this is what i got<br />
Node* lookup( int key, Node* node ) {<br />
/* TODO */<br />
<br />
while(node != empty){<br />
if(key == node->key)<br />
return node;<br />
else if (key < node->key)<br />
node = node->left;<br />
else<br />
node = node->right;<br />
} <br />
}<br />
im unsure about how to test it though so i dont know if its actually right</div>Mark