lec19 - Click to edit Master subtitle style 2/7/11 CS/IS...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Click to edit Master subtitle style 2/7/11 CS/IS C363 DS&A (General) Trees- Traversal(s) - Depth First Traversal- Breadth First Traversal- Applications 2/7/11 11 CS/IS C363 DS&A 2/7/11 CS/IS C363 DS&A Trees - Representation A tree is either an empty tree OR a root element with one or more children (i.e. subtrees) N-ary trees Maximum number of children for any node is N Arbitrary Branching Number of children is finite but not bounded 2/7/11 CS/IS C363 DS&A 22 2/7/11 CS/IS C363 DS&A Trees - Examples Examples Phylogenetic Trees File System A file system can be represented as a tree: Each directory (or folder in Windows) is a non- terminal node Each non-directory file is a terminal node 2/7/11 CS/IS C363 DS&A 33 2/7/11 CS/IS C363 DS&A Trees - Examples 2/7/11 CS/IS C363 DS&A 44 Figure from 2/7/11 CS/IS C363 DS&A Trees Operations and Operations TREE createTree(int maxChildren) // Use an invalid argument for arbitrary braching...
View Full Document

Page1 / 14

lec19 - Click to edit Master subtitle style 2/7/11 CS/IS...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online