https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE250%3Alab-6%3Asbas046 2026-04-28T17:27:35Z Revision history for this page on the wiki MediaWiki 1.45.3 https://wiki.kram.nz/index.php?title=SE250:lab-6:sbas046&diff=7292&oldid=prev 2008-11-03T05:20:08Z

<p>6 revision(s)</p> <p><b>New page</b></p><div>== Task 1 ==<br /> I looped 200 times, each time incrementing the size by 5.<br /> I printed the results and plotted a graph in Excel.<br /> <br /> &#039;&#039;&#039;Graph&#039;&#039;&#039;<br /> <br /> [http://img32.picoodle.com/img/img32/4/5/5/f_BinaryTreeGm_b3e1575.jpg/ Link to graph]<br /> <br /> &#039;&#039;&#039;Code&#039;&#039;&#039;<br /> &lt;pre&gt;<br /> int main(){<br /> <br /> int h, i;<br /> Node *randomTree;<br /> printf(&quot;Size, Height\n&quot;);<br /> <br /> <br /> for (i = 0; i &lt; 1000; i=i+5){<br /> randomTree = makeRandomTree(i);<br /> h = height(randomTree);<br /> printf(&quot;%d\n&quot;, h);<br /> }<br /> <br /> return 0;<br /> }<br /> &lt;/pre&gt;<br /> <br /> == Task 2 ==<br /> &#039;&#039;&#039;Minimum Function&#039;&#039;&#039;<br /> &lt;pre&gt;<br /> Node* minimum( Node* node ) {<br /> if (node == empty)<br /> return node;<br /> for (; node-&gt;left != empty; node = node-&gt;left);<br /> return node;<br /> }<br /> &lt;/pre&gt;<br /> <br /> &#039;&#039;&#039;Maximum Function&#039;&#039;&#039;<br /> &lt;pre&gt;<br /> Node* maximum( Node* node ) {<br /> if (node == empty)<br /> return node;<br /> for (; node-&gt;right != empty; node = node-&gt;right);<br /> return node;<br /> }<br /> &lt;/pre&gt;<br /> <br /> <br /> == Task 3 ==<br /> &#039;&#039;&#039;Lookup Function&#039;&#039;&#039;<br /> &lt;pre&gt;<br /> Node* lookup( int key, Node* node ) {<br /> <br /> while(node != empty){<br /> if (node == empty)<br /> return node;<br /> <br /> if (node-&gt;key == key){<br /> return node;<br /> }else if(node-&gt;key &lt; key){<br /> node = node-&gt;right;<br /> }else{<br /> node = node-&gt;left;<br /> }<br /> }<br /> }<br /> &lt;/pre&gt;</div>

Mark