https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE250%3AApril_30 2026-04-28T21:15:52Z Revision history for this page on the wiki MediaWiki 1.45.3 https://wiki.kram.nz/index.php?title=SE250:April_30&diff=1763&oldid=prev 2008-11-03T05:08:39Z

<p>1 revision(s)</p> <p><b>New page</b></p><div>==Agenda==<br /> *A &#039;&#039;&#039;tree&#039;&#039;&#039; is used to represent hierachhical relationships between objects.<br /> *a tree consists of &#039;&#039;&#039;nodes&#039;&#039;&#039; that arer linked by &#039;&#039;&#039;edges&#039;&#039;&#039;.<br /> *each edge points from a &#039;&#039;&#039;parent&#039;&#039;&#039;(node) to a &#039;&#039;&#039;child&#039;&#039;&#039;(node).<br /> *a node with no children is a &#039;&#039;&#039;leaf&#039;&#039;&#039;.<br /> *each node has a unique parent<br /> *the &#039;&#039;&#039;root&#039;&#039;&#039; of the tree is only node with no parent.<br /> *the &#039;&#039;&#039;depth&#039;&#039;&#039; of a node is the number of edges on its path to the root.<br /> *the &#039;&#039;&#039;height&#039;&#039;&#039; of a tree is the maximum depth of a node<br /> <br /> &#039;&#039;&#039;Binary trees&#039;&#039;&#039;<br /> *every node has at most 2 children<br /> *if all leaves are at the same depth then the tree is full.<br /> ==Minutes==<br /> Minute taker: [[User:shua066|shua066]]</div>

Mark