# Lecture Notes for CS 230 - LAB: Data Structures at Wellesley College

## Notes Information

 Material Type: Class Note Professor: Staff Class: CS 230 - LAB: Data Structures Subject: Computer Science University: Wellesley College Term: Spring 2009 Keywords: On the LeftOn the RightReturn ResultHierarchical StructurePossible SetControllingInorder TraversalHierarchicalInterestingImplementation

## Sample Document Text

4/13/09 1 16.1 - Trees ? A tree is a non-linear hierarchical structure ? Tree is comprised of a set of nodes in which elements are stored and edges connect one node to another ? A node can have only one parent, but may have mul iple children ? Nodes hat have the same parent are siblings ? There is only one root node in the tree ? The root is he only node which has no parent 16.1 - Tree Terminology ? The level of a node is the length of he path from the root to he node ? The path length is determined by counting the number of edges that must be followed to get from the root to the node ? The height (or depth) of a tree is the length of he longest path from the root to a leaf A B C E D F G Level 0 1 3 2 ? A node that has no children is a leaf node ? A note hat is not the root and has at least one child is an internal node ? A subtree is a tree structure that makes up part of another tree ? We can follow a p...

## Related Documents

On the Left Notes
On the Right Notes
On the Left Exam
On the Left Notes
On the Left Notes
On the Left Notes
On the Left Notes
On the Right Exam
On the Left Notes
Inorder Traversal Notes
Current Number Notes
On the Left Notes
On the Right Notes
On the Right Notes
On the Left Notes
Mechanistic Organization Notes