Lecture13

# Lecture13 - Algorithms in Systems Engineering IE172 Lecture...

• 18

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

Algorithms in Systems Engineering IE172 Lecture 13 Dr. Ted Ralphs

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

IE172 Lecture 13 1 References for Today’s Lecture Required reading Sections 6.1-6.36 References CLRS Chapter 21 and 22 R. Sedgewick, Algorithms in C++ (Third Edition), 1998.
IE172 Lecture 13 2 Trees A tree is a set of items organized into a hierarchical structure (think of a family tree). When organized in this way, we call the items nodes . Each node has a single designated parent and one or more children . There is a single designated node, called the root , with no parent. Any node with no children is called a leaf . Any node with children is called internal . A tree in which all nodes have 2 or fewer children is called a binary tree . Storing a list of items in a tree structure allows us to represent additional relationships among the items in the list. Trees occur naturally in a wide variety of applications.

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

IE172 Lecture 13 3 Trees in Action File system Philogenic Trees Family Trees Call Trees Web page
IE172 Lecture 13 4 Additional Terminology The level of a node in the tree is the number of recursive calls to parent() needed to reach the root. The depth of the tree is the maximum level of any of its nodes.

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

This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern