https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE250%3Alab-6%3Ahbar055SE250:lab-6:hbar055 - Revision history2026-04-28T21:23:04ZRevision history for this page on the wikiMediaWiki 1.45.3https://wiki.kram.nz/index.php?title=SE250:lab-6:hbar055&diff=7106&oldid=prevMark: 1 revision(s)2008-11-03T05:20:04Z<p>1 revision(s)</p>
<p><b>New page</b></p><div>==Tasks==<br />
==minimum==<br />
<br />
the following code will "hopefully" find the minimum value of the binary search tree... unsure if its correcte (untested), but its the basic idea...<br />
<br />
Node* minimum( Node* node ) {<br />
if (node == empty){<br />
return empty;<br />
}<br />
while ( (*node)->left != empty){<br />
node = &(*node)->left;<br />
} <br />
return node;<br />
}<br />
<br />
==maximum==<br />
<br />
the following code will "hopefully" find the maximum value of the binary search tree... unsure if its correcte (untested), but its the basic idea...<br />
<br />
Node* maximum( Node* node ) {<br />
if (node == empty){<br />
return empty;<br />
}<br />
while ( (*node)->right != empty){<br />
node = &(*node)->right;<br />
} <br />
return node;<br />
}<br />
<br />
<br />
==lookup==<br />
<br />
the following code will "hopefully" find the node of the given key from the binary search tree... unsure if its correct (untested), but its the basic idea...<br />
<br />
Node* lookup( int key, Node* node ) {<br />
if (node == empty){<br />
return empty;<br />
}<br />
if (key < (*node)->key){<br />
return (lookup(key, (*node)->left));<br />
}<br />
else if (key > (*node)->key){<br />
return (lookup(key, (*node)->right));<br />
}<br />
else if (key == (*node)->key){<br />
return node;<br />
}<br />
//now this leaves onething out... what to do if the key isnt in the tree.. :S (would wnd up with <br />
an endless loop...<br />
}<br />
<br />
==next_prev==<br />
<br />
Im assuming this means the next value/node on the binary tree (from, the given one)... code is basically as follows, but not tested, not fully functioning... hehe... question wasent really clear.<br />
<br />
<br />
Node* next_pre( Node* node ) {<br />
if (node == empty){<br />
return empty;<br />
}<br />
if ( (*node)->right == empty){<br />
return node;<br />
}<br />
else{<br />
node = (*node)->right;<br />
return (minimum(node));<br />
}<br />
<br />
}<br />
<br />
==prev_pre==<br />
<br />
Im assuming this means the previous value/node on the binary tree (from, the given one)... code is basically as follows, but not tested, not fully functioning... hehe... question wasent really clear...<br />
<br />
Node* prev_pre( Node* node ) {<br />
if (node == empty){<br />
return empty;<br />
}<br />
if ( (*node)->left == empty){<br />
return node;<br />
}<br />
else{<br />
node = (*node)->left;<br />
return (maximum(node));<br />
}<br />
<br />
}<br />
<br />
<br />
==Conclusion==<br />
<br />
Would be nice if we knew what we were doing. we knew the functionality of the binary trees, but we were never thought HOW to actually make it function. would be nice if we had a lecture on it before the lab next time.</div>Mark