<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en-GB">
	<id>https://wiki.kram.nz/index.php?action=history&amp;feed=atom&amp;title=SE250%3Alab-6%3Ashua066</id>
	<title>SE250:lab-6:shua066 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.kram.nz/index.php?action=history&amp;feed=atom&amp;title=SE250%3Alab-6%3Ashua066"/>
	<link rel="alternate" type="text/html" href="https://wiki.kram.nz/index.php?title=SE250:lab-6:shua066&amp;action=history"/>
	<updated>2026-04-28T23:54:18Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.45.3</generator>
	<entry>
		<id>https://wiki.kram.nz/index.php?title=SE250:lab-6:shua066&amp;diff=7346&amp;oldid=prev</id>
		<title>Mark: 10 revision(s)</title>
		<link rel="alternate" type="text/html" href="https://wiki.kram.nz/index.php?title=SE250:lab-6:shua066&amp;diff=7346&amp;oldid=prev"/>
		<updated>2008-11-03T05:20:09Z</updated>

		<summary type="html">&lt;p&gt;10 revision(s)&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;==Lab6==&lt;br /&gt;
===Task 1===&lt;br /&gt;
&lt;br /&gt;
the relationship between the size and the height is &lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
size	height&lt;br /&gt;
1	1&lt;br /&gt;
2	2&lt;br /&gt;
3	3&lt;br /&gt;
4	4&lt;br /&gt;
5	5&lt;br /&gt;
6	5&lt;br /&gt;
7	5&lt;br /&gt;
8	6&lt;br /&gt;
9	6&lt;br /&gt;
10	6&lt;br /&gt;
20	9&lt;br /&gt;
30	10&lt;br /&gt;
40	10&lt;br /&gt;
60	11&lt;br /&gt;
100	13&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
====code====&lt;br /&gt;
 int main(){&lt;br /&gt;
     int a=60;&lt;br /&gt;
     printf(&amp;quot; the height is %d &amp;quot;, height(makeRandomTree(a)));&lt;br /&gt;
 }&lt;br /&gt;
===Task 2===&lt;br /&gt;
====code====&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Node* minimum( Node* node ) {&lt;br /&gt;
  /* TODO */&lt;br /&gt;
    if( node ==  empty)&lt;br /&gt;
	return ;&lt;br /&gt;
    while (node != empty){&lt;br /&gt;
        node = node-&amp;gt;left;&lt;br /&gt;
	return node;&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
Node* maximum( Node* node ) {&lt;br /&gt;
  /* TODO */&lt;br /&gt;
    if (node == empty)&lt;br /&gt;
	return ;&lt;br /&gt;
    while (node != empty){&lt;br /&gt;
	node= node-&amp;gt;right;&lt;br /&gt;
	return node;&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
 printf(&amp;quot;the min node is %d\n &amp;quot;, minimum(makeRandomTree(a)));&lt;br /&gt;
 printf(&amp;quot;the max node is %d &amp;quot;, maximum(makeRandomTree(a)));&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====result====&lt;br /&gt;
  the min node is 17041240&lt;br /&gt;
  the max node is 17042680&lt;br /&gt;
the number is very big&lt;/div&gt;</summary>
		<author><name>Mark</name></author>
	</entry>
</feed>