FIT1008 Lecture 11: Week 11 - tree terminology
18 Jun 2018
School
Department
Course
Professor
Tree$="graph"which"is"connected"and"has"no"circuits
Natural"way"of"modeling"many"things"(eg."family"trees,"organisation"structure"
charts,"chapters"and"sections"in"a"book,"execution/call" tree,"OO"class"hierarchies)
Good"for"some"operations"like"searching
•
Compact"data"representation
•
Root$="node"with"no"parent,"very"top"node
*every"other"node"is"a"child
Leaf$="node"with"no"child
If$neither$root$or$leaf,$becomes$inner$node.
Depth ="length"of"a"path"from"the"root"to"the"deepest"node
Level$=$length"of"path"from"root"node."Aka"reverse"of"depth/height.
**"starts"from"ZERO!!!
Week$11:$tree$terminology
Friday,"15"June"2018
17:35
