Lecture10 - IE 495 Lecture 10 September 28, 2000 Reading...

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: IE 495 Lecture 10 September 28, 2000 Reading for This Lecture Primary Horowitz and Sahni, Chapter 2, Section 3 More Data Structures Trees A (directed) tree is a directed acylic graph satisfying the following: There is exactly one vertex called the root with in-degree 0. Every other vertex has in-degree 1. There is a path from the root node to every other node. Trees also have a natural recursive definition. Tree terminology If ( u , v ) E , then u is called the father / mother / parent of v and v is called the son / daughter of u . If there is a path from u to v , then v is a descendant of u and u is an ancestor of v . More Tree Terminology A tree in which each node has out-degree 0, 1, or 2 is called a binary tree . A tree in which the sons are ordered is called an ordered tree . In an ordered binary tree, the two sons are usually called the left son and the right son ....
View Full Document

This note was uploaded on 08/06/2008 for the course IE 495 taught by Professor Linderoth during the Fall '08 term at Lehigh University .

Page1 / 14

Lecture10 - IE 495 Lecture 10 September 28, 2000 Reading...

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