L15 - CME/Energy 211 Margot Gerritsen Shela Aboud Emmet...

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

View Full Document Right Arrow Icon
CME/Energy 211 Margot Gerritsen Shela Aboud Emmet Caulfield
Background image of page 1

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

View Full DocumentRight Arrow Icon
Lecture Overview • Applications • Datastructures – Trees – Hashtables – Graphs
Background image of page 2
Applications/Examples Stacks – function calls Queues-Unix pipes, cluster job submission, Trees – organize file systems on a computer, family tree Graph-link structure of a website, social networks, computer processing of molecule structure Hash Tables- database searching
Background image of page 3

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

View Full DocumentRight Arrow Icon
Trees A tree can be represented by a linked data structure where each node has a key (which can be a value, a condition, or a data structure) and pointers to other nodes. The node that is pointing to another node is the parent and the node being pointed to is called the child . There is only one path connecting the any pair of nodes – each child only has one parent (if there is more than one path it is called a graph). For a rooted tree the initial node is called a root .
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 13

L15 - CME/Energy 211 Margot Gerritsen Shela Aboud Emmet...

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

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