1 / 72

# Kenneth H. Rosen Chapter 8 Trees - PowerPoint PPT Presentation

Discrete Mathematics and Its Applications. Kenneth H. Rosen Chapter 8 Trees Slides by Sylvia Sorkin, Community College of Baltimore County - Essex Campus. Tree. Definition 1. A tree is a connected undirected graph with no simple circuits.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

Kenneth H. Rosen Chapter 8 Trees

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

#### Presentation Transcript

Discrete Mathematics and Its Applications

Kenneth H. Rosen

Chapter 8

Trees

Slides by Sylvia Sorkin, Community College of Baltimore County - Essex Campus

### Tree

Definition 1. A tree is a connected undirected graph with no simple circuits.

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

b)

a)

c)

### Specify a vertex as root

Then, direct each edge away from the root.

ROOT

c)

### Specify a root.

Then, direct each edge away from the root.

ROOT

a)

### Specify a root.

Then, direct each edge away from the root.

ROOT

a)

### Specify a root.

Then, direct each edge away from the root.

ROOT

a)

A directed graph called

a rooted tree results.

### What if a different root is chosen?

Then, direct each edge away from the root.

ROOT

a)

### What if a different root is chosen?

Then, direct each edge away from the root.

ROOT

a)

### What if a different root is chosen?

Then, direct each edge away from the root.

ROOT

a)

### What if a different root is chosen?

Then, direct each edge away from the root.

ROOT

a)

A different

rooted tree results.

Jake’s Pizza Shop Tree

Owner Jake

WaitressWaiter Cook Helper

Joyce Chris Max Len

A Tree Has a Root

TREE ROOT

Owner Jake

WaitressWaiter Cook Helper

Joyce Chris Max Len

Leaf nodes have no children

Owner Jake

WaitressWaiter Cook Helper

Joyce Chris Max Len

LEAF NODES

A Tree Has Levels

Owner Jake

WaitressWaiter Cook Helper

Joyce Chris Max Len

LEVEL 0

Level One

Owner Jake

WaitressWaiter Cook Helper

Joyce Chris Max Len

LEVEL 1

Level Two

Owner Jake

WaitressWaiter Cook Helper

Joyce Chris Max Len

LEVEL 2

Sibling nodes have same parent

Owner Jake

WaitressWaiter Cook Helper

Joyce Chris Max Len

SIBLINGS

Sibling nodes have same parent

Owner Jake

WaitressWaiter Cook Helper

Joyce Chris Max Len

SIBLINGS

A Subtree

ROOT

Owner Jake

WaitressWaiter Cook Helper

Joyce Chris Max Len

LEFT SUBTREE OF ROOT

Another Subtree

ROOT

Owner Jake

WaitressWaiter Cook Helper

Joyce Chris Max Len

RIGHT SUBTREE OF ROOT

### Internal Vertex

A vertex that has children is calledan internal vertex.

The subtree at vertex v is the subgraph of the tree consisting of vertex v and its descendants and all edges incident to those descendants.

How many internal vertices?

Owner Jake

WaitressWaiter Cook Helper

Joyce Chris Max Len

### Binary Tree

Definition 2’. A rooted tree is called a binary tree if every internal vertex has no more than 2 children.

The tree is called a full binary tree if every internal vertex has exactly 2 children.

### Ordered Binary Tree

Definition 2’’. An ordered rooted tree is a rooted tree where the children of each internal vertex are ordered.

In an ordered binary tree, the two possible children of a vertex are called the left child and the right child, if they exist.

### Tree Properties

Theorem 2. A tree with N vertices has N-1 edges.

Theorem 5. There are at most 2H leaves in a binary tree of height H.

Corallary. If a binary tree with L leaves is full and balanced, then its height is

H = log2 L .

Lou

Hal

Max

Ken

Sue

Ed

Joe

Ted

### Parent

• The parent of a non-root vertex is the unique vertex u with a directed edge from u to v.

Lou

Hal

Max

Ken

Sue

Ed

Joe

Ted

### Leaf

• A vertex is called a leaf if it has no children.

Lou

Hal

Max

Ken

Sue

Ed

Joe

Ted

### Ancestors

• The ancestors of a non-root vertex are all the vertices in the path from root to this vertex.

Lou

Hal

Max

Ken

Sue

Ed

Joe

Ted

### Descendants

• The descendants of vertex v are all the vertices that have v as an ancestor.

Lou

Hal

Max

Ken

Sue

Ed

Joe

Ted

### Level

• The level of vertex v in a rooted tree is the length of the unique path from the root to v.

Lou

Hal

Max

Ken

Sue

Ed

Joe

Ted

### Height

• The height of a rooted tree is the maximum of the levels of its vertices.

Lou

Hal

Max

Ken

Sue

Ed

Joe

Ted

### Balanced

• A rooted binary tree of height H is called balanced if all its leaves are at levels H or H-1.

Lou

Hal

Max

Ken

Sue

Ed

Joe

Ted

### Searching takes time . . .

So the goal in computer programs is to find any stored item efficiently when all stored items are ordered.

A Binary Search Tree can be used to store items in its vertices. It enables efficient searches.

### A Binary Search Tree (BST) is . . .

A special kind of binary tree in which:

1. Each vertex contains a distinct key value,

2. The key values in the tree can be compared using “greater than” and “less than”, and

3. The key value of each vertex in the tree is

less than every key value in its right subtree, and greater than every key value in its left subtree.

‘J’

### Shape of a binary search tree . . .

Depends on its key values and their order of insertion.

Insert the elements ‘J’ ‘E’ ‘F’ ‘T’ ‘A’ in that order.

The first value to be inserted is put into the root.

‘J’

‘E’

### Inserting ‘E’ into the BST

Thereafter, each value to be inserted begins by comparing itself to the value in the root, moving left it is less, or moving right if it is greater. This continues at each level until it can be inserted as a new leaf.

‘J’

‘E’

### Inserting ‘F’ into the BST

Begin by comparing ‘F’ to the value in the root, moving left it is less, or moving right if it is greater. This continues until it can be inserted as a leaf.

‘F’

‘J’

‘T’

‘E’

### Inserting ‘T’ into the BST

Begin by comparing ‘T’ to the value in the root, moving left it is less, or moving right if it is greater. This continues until it can be inserted as a leaf.

‘F’

‘J’

‘T’

‘E’

‘A’

‘F’

### Inserting ‘A’ into the BST

Begin by comparing ‘A’ to the value in the root, moving left it is less, or moving right if it is greater. This continues until it can be inserted as a leaf.

‘A’

### What binary search tree . . .

is obtained by inserting

the elements ‘A’ ‘E’ ‘F’ ‘J’ ‘T’ in that order?

‘A’

‘E’

‘F’

‘J’

‘T’

### Binary search tree . . .

obtained by inserting

the elements ‘A’ ‘E’ ‘F’ ‘J’ ‘T’ in that order.

‘J’

### Another binary search tree

‘T’

‘E’

‘A’

‘H’

‘M’

‘P’

‘K’

Add nodes containing these values in this order:

‘D’ ‘B’ ‘L’ ‘Q’ ‘S’ ‘V’ ‘Z’

‘D’

‘Z’

‘K’

‘B’

‘L’

‘Q’

‘S’

‘J’

‘T’

‘E’

‘A’

‘V’

‘M’

‘H’

‘P’

### Traversal Algorithms

• A traversal algorithm is a procedure for systematically visiting every vertex of an ordered binary tree.

• Tree traversals are defined recursively.

• Three traversals are named:

preorder,

inorder,

postorder.

### PREORDER Traversal Algorithm

Let T be an ordered binary tree with root r.

If T has only r, then r is the preorder traversal.

Otherwise, suppose T1, T2 are the left and right subtrees at r. The preorder traversal begins by visiting r. Then traverses T1 in preorder, then traverses T2 in preorder.

‘J’

### Preorder Traversal: J E A H T M Y

Visit first.

ROOT

‘T’

‘E’

‘A’

‘H’

‘M’

‘Y’

Visit left subtree second

Visit right subtree last

### INORDER Traversal Algorithm

Let T be an ordered binary tree with root r.

If T has only r, then r is the inorder traversal.

Otherwise, suppose T1, T2 are the left and right subtrees at r. The inorder traversal begins by traversing T1 in inorder. Then visits r, then traverses T2 in inorder.

‘J’

### Inorder Traversal: A E H J M T Y

Visit second

ROOT

‘T’

‘E’

‘A’

‘H’

‘M’

‘Y’

Visit left subtree first

Visit right subtree last

### POSTORDER Traversal Algorithm

Let T be an ordered binary tree with root r.

If T has only r, then r is the postorder traversal.

Otherwise, suppose T1, T2 are the left and right subtrees at r. The postorder traversal begins by traversing T1 in postorder. Then traverses T2 in postorder, then ends by visiting r.

‘J’

Postorder Traversal: A H E M Y T J

Visit last

ROOT

‘T’

‘E’

‘A’

‘H’

‘M’

‘Y’

Visit left subtree first

Visit right subtree second

### A Binary Expression Tree

ROOT

‘-’

‘8’

‘5’

INORDER TRAVERSAL: 8 - 5 has value 3

PREORDER TRAVERSAL: - 8 5

POSTORDER TRAVERSAL:8 5 -

### A Binary Expression Tree is . . .

A special kind of binary tree in which:

1. Each leaf node contains a single operand,

2. Each nonleaf node contains asingle binary operator, and

3. The left and right subtrees of an operator node represent subexpressions that must be evaluated before applying the operator at the root of the subtree.

‘*’

‘3’

‘+’

‘2’

‘4’

### A Binary Expression Tree

What value does it have?

( 4 + 2 ) * 3 = 18

‘*’

‘3’

‘+’

‘2’

‘4’

### A Binary Expression Tree

What infix, prefix, postfix expressions does it represent?

‘*’

‘3’

‘+’

‘2’

‘4’

### A Binary Expression Tree

Infix: ( ( 4 + 2 ) * 3 )

Prefix: * + 4 2 3 evaluate from right

Postfix: 4 2 + 3 * evaluate from left

### Levels Indicate Precedence

When a binary expression tree is used to represent an expression, the levels of the nodes in the tree indicate their relative precedence of evaluation.

Operations at higher levels of the tree are evaluated later than those below them.The operation at the root is always the last operation performed.

‘/’

‘3’

‘+’

‘2’

‘4’

### Evaluate this binary expression tree

‘*’

‘-’

‘5’

‘8’

What infix, prefix, postfix expressions does it represent?

‘*’

‘/’

‘-’

‘8’

‘5’

‘3’

‘+’

‘2’

‘4’

### A binary expression tree

Infix: ( ( 8 - 5 ) * ( ( 4 + 2 ) / 3 ) )

Prefix: * - 8 5 / + 4 2 3

Postfix: 8 5 - 4 2 + 3 / * has operators in order used

‘*’

‘/’

‘-’

‘8’

‘5’

‘3’

‘+’

‘2’

‘4’

### A binary expression tree

Infix: ( ( 8 - 5 ) * ( ( 4 + 2 ) / 3 ) )

Prefix: * - 8 5 / + 4 2 3 evaluate from right

Postfix: 8 5 - 4 2 + 3 / * evaluate from left

‘/’

### Inorder Traversal: (A + H) / (M - Y)

Print second

ROOT

‘-’

‘+’

‘A’

‘H’

‘M’

‘Y’

Print left subtree first

Print right subtree last

‘/’

### Preorder Traversal: / + A H - M Y

Print first

ROOT

‘-’

‘+’

‘A’

‘H’

‘M’

‘Y’

Print left subtree second

Print right subtree last

‘/’

Postorder Traversal: A H + M Y - /

Print last

ROOT

‘-’

‘+’

‘A’

‘H’

‘M’

‘Y’

Print left subtree first

Print right subtree second

### ACKNOWLEDGMENT:

This project was supported in part by the National Science Foundation under grant DUE-ATE 9950056.
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}