SE250:April 30

From Marks Wiki
Revision as of 05:08, 3 November 2008 by Mark (Sọ̀rọ̀ | contribs) (1 revision(s))
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Agenda

  • A tree is used to represent hierachhical relationships between objects.
  • a tree consists of nodes that arer linked by edges.
  • each edge points from a parent(node) to a child(node).
  • a node with no children is a leaf.
  • each node has a unique parent
  • the root of the tree is only node with no parent.
  • the depth of a node is the number of edges on its path to the root.
  • the height of a tree is the maximum depth of a node

Binary trees

  • every node has at most 2 children
  • if all leaves are at the same depth then the tree is full.

Minutes

Minute taker: shua066

Retrieved from ‘https://wiki.kram.nz/index.php?title=SE250:April_30&oldid=1763’