1 / 80

# Trees - PowerPoint PPT Presentation

Trees. Main and Savitch Chapter 10. Binary Trees. A binary tree has nodes , similar to nodes in a linked list structure. Data of one sort or another may be stored at each node. But it is the connections between the nodes which characterize a binary tree. A Binary Tree of States.

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

## PowerPoint Slideshow about 'Trees' - balthasar

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

### Trees

Main and Savitch

Chapter 10

• A binary tree has nodes, similar to nodes in a linked list structure.

• Data of one sort or another may be stored at each node.

• But it is the connections between the nodes which characterize a binary tree.

In this example, the data contained at each node is one of the 50 states.

Each tree has a special node called its root, usually drawn at the top.

Each tree has a special node called its root, usually drawn at the top.

The example tree

has Washington

as its root.

Each node is permitted to have two links to other nodes, called the left childand the right child.

Children are usually drawn below a node.

The right child of

Washington is

The left child of

Washington is

Arkansas.

Some nodes have only one child.

Arkansas has a

left child, but no

right child.

Some nodes have only one child.

Which node has

only a right child?

Some nodes have only one child.

Florida has

only a right child.

A node with no children is called a leaf.

Each node is called the parent of its children.

Washington is the

parent of Arkansas

• The root has no parent.

• Every other node has exactly one parent.

Two nodes with the same parent are called siblings.

Arkansas

are siblings.

A complete binary tree is a special kind of binary tree which will be useful to us.

A complete binary tree is a special kind of binary tree which will be useful to us.

When a complete

binary tree is built,

its first node must be

the root.

The second node of a complete binary tree is always the left child of the root...

The second node of a complete binary tree is always the left child of the root...

... and the third node is always the right child of the root.

The next nodes must always fill the next level from left to right.

The next nodes must always fill the next level from left to right.

The next nodes must always fill the next level from left to right.

The next nodes must always fill the next level from left to right.

The next nodes must always fill the next level from left to right.

The next nodes must always fill the next level from left to right.

Yes!

It is called the empty tree, and it has no nodes, not even a root.

Implementing a Complete Binary Tree

An integer to keep

track of how many nodes are in the tree

3

An array of data

We don't care what's in

this part of the array.

Implementing a Complete Binary Tree

An integer to keep

track of how many nodes are in the tree

3

see details of how

the entries are stored.

An array of data

We don't care what's in

this part of the array.

Depth of Binary Tree array.

This example, depth = 3

Depth of Binary Tree array.

This example, depth = 2

Depth of Binary Tree array.

This example, depth = 0

Given a complete binary tree of N nodes, what is the depth?

D = 0

N = 1

D = 1

N = 3

D = 1

N = 2

D = 2

N = 4

D = 2

N = 7

Given a complete binary tree of N nodes, what is the depth?

D = 0

N = 1

D = 1

N = 3

D = 1

N = 2

D = 2

N = 4

D = 2

N = 7

D = floor(log N) = O(log N)

Depth of Binary Tree array.

Given a binary tree of N nodes, what is the maximum possible depth?

D = 0

N = 1

D = 2

N = 3

D = 4

N = 5

D = O(N)

Summary array.

• Binary trees contain nodes.

• Each node may have a left child and a right child.

• If you start from any node and move upward, you will eventually reach the root.

• Every node except the root has one parent. The root has no parent.

• Complete binary trees require the nodes to fill in each level from left-to-right before starting the next level.

Binary Search Trees array.

• One of the tree applications in Chapter 10 is binary search trees.

• In Chapter 10, binary search trees are used to implement bags and sets.

• This presentation illustrates how another data type called a dictionary is implemented with binary search trees.

The Dictionary Data Type array.

• A dictionary is a collection of items, similar to a bag.

• But unlike a bag, each item has a string attached to it, called the item's key.

The Dictionary Data Type array.

• A dictionary is a collection of items, similar to a bag.

• But unlike a bag, each item has a string attached to it, called the item's key.

Example:

The items I am

storing are records

containing data

The Dictionary Data Type array.

• A dictionary is a collection of items, similar to a bag.

• But unlike a bag, each item has a string attached to it, called the item's key.

Example:

The key for each

record is the name

of the state.

Washington

The Dictionary Data Type array.

void Dictionary::insert(The key for the new item, The new item);

• The insertion procedure for a dictionary has two parameters.

Washington

The Dictionary Data Type array.

• When you want to retrieve an item, you specify the key...

Item Dictionary::retrieve("Washington");

The Dictionary Data Type array.

• When you want to retrieve an item, you specify the key... ... and the retrieval procedure returns the item.

Item Dictionary::retrieve("Washington");

The Dictionary Data Type array.

• We'll look at how a binary tree can be used as the internal storage mechanism for the dictionary.

Arizona array.

Arkansas

A Binary Search Tree of States

Florida

The data in the dictionary will be stored in a binary tree, with each node containing an item and a key.

Oklahoma

Mass.

Washington

New

Hampshire

West

Virginia

Arizona

Arkansas

A Binary Search Tree of States

Florida

Storage rules:

• Every key to the left of a node is alphabetically before the key of the node.

Oklahoma

Mass.

Washington

New

Hampshire

West

Virginia

Arizona array.

A Binary Search Tree of States

Florida

Storage rules:

• Every key to the left of a node is alphabetically before the key of the node.

Oklahoma

Mass.

Washington

Example:

' Massachusetts' and

' New Hampshire'

are alphabetically

before 'Oklahoma'

New

Hampshire

West

Virginia

Arkansas

Arizona array.

A Binary Search Tree of States

Florida

Storage rules:

• Every key to the left of a node is alphabetically before the key of the node.

• Every key to the right of a node is alphabetically after the key of the node.

Oklahoma

Mass.

Washington

New

Hampshire

West

Virginia

Arkansas

Arizona array.

A Binary Search Tree of States

Florida

Storage rules:

• Every key to the left of a node is alphabetically before the key of the node.

• Every key to the right of a node is alphabetically after the key of the node.

Oklahoma

Mass.

Washington

New

Hampshire

West

Virginia

Arkansas

Arizona array.

Retrieving Data

Florida

Start at the root.

1. If the current node has the key, then stop and retrieve the data.

2. If the current node's key is too large, move left and repeat 1-3.

3. If the current node's key is too small, move right and repeat 1-3.

Oklahoma

Mass.

Washington

New

Hampshire

West

Virginia

Arkansas

Arizona array.

Retrieve ' New Hampshire'

Florida

Start at the root.

1. If the current node has the key, then stop and retrieve the data.

2. If the current node's key is too large, move left and repeat 1-3.

3. If the current node's key is too small, move right and repeat 1-3.

Oklahoma

Mass.

Washington

New

Hampshire

West

Virginia

Arkansas

Arizona array.

Retrieve 'New Hampshire'

Florida

Start at the root.

1. If the current node has the key, then stop and retrieve the data.

2. If the current node's key is too large, move left and repeat 1-3.

3. If the current node's key is too small, move right and repeat 1-3.

Oklahoma

Mass.

Washington

New

Hampshire

West

Virginia

Arkansas

Arizona array.

Retrieve 'New Hampshire'

Florida

Start at the root.

1. If the current node has the key, then stop and retrieve the data.

2. If the current node's key is too large, move left and repeat 1-3.

3. If the current node's key is too small, move right and repeat 1-3.

Oklahoma

Mass.

Washington

New

Hampshire

West

Virginia

Arkansas

Arizona array.

Retrieve 'New Hampshire'

Florida

Start at the root.

1. If the current node has the key, then stop and retrieve the data.

2. If the current node's key is too large, move left and repeat 1-3.

3. If the current node's key is too small, move right and repeat 1-3.

Oklahoma

Mass.

Washington

New

Hampshire

West

Virginia

Arkansas

Retrieval: Complexity array.

• Given a complete tree of N items, the depth D = O(log N).

• What is the maximum number of nodes tested to retrieve an item from the binary search tree if we use a complete tree?

• What is the maximum number of nodes tested (worst case) to retrieve an item from a binary search tree that is not complete or balanced?

Arizona array.

Adding a New Item with aGiven Key

Florida

1. Pretend that you are trying to find the key, but stop when there is no node to move to.

2. Add the new node at the spot where you would have moved to if there had been a node.

Oklahoma

Mass.

Washington

New

Hampshire

West

Virginia

Arkansas

Arizona array.

Iowa

Florida

• Pretend that you are trying to find the key, but stop when there is no node to move to.

• Add the new node at the spot where you would have moved to if there had been a node.

Oklahoma

Mass.

Washington

New

Hampshire

West

Virginia

Arkansas

Arizona array.

Iowa

Florida

• Pretend that you are trying to find the key, but stop when there is no node to move to.

• Add the new node at the spot where you would have moved to if there had been a node.

Oklahoma

Mass.

Washington

New

Hampshire

West

Virginia

Arkansas

Arizona array.

Iowa

Florida

• Pretend that you are trying to find the key, but stop when there is no node to move to.

• Add the new node at the spot where you would have moved to if there had been a node.

Oklahoma

Mass.

Washington

New

Hampshire

West

Virginia

Arkansas

Arizona array.

Iowa

Florida

• Pretend that you are trying to find the key, but stop when there is no node to move to.

• Add the new node at the spot where you would have moved to if there had been a node.

Oklahoma

Mass.

Washington

New

Hampshire

West

Virginia

Arkansas

Arizona array.

Iowa

Florida

• Pretend that you are trying to find the key, but stop when there is no node to move to.

• Add the new node at the spot where you would have moved to if there had been a node.

Oklahoma

Mass.

Washington

New

Hampshire

West

Virginia

Arkansas

Arizona array.

Florida

• Pretend that you are trying to find the key, but stop when there is no node to move to.

• Add the new node at the spot where you would have moved to if there had been a node.

Oklahoma

Mass.

Washington

Iowa

New

Hampshire

West

Virginia

Arkansas

Arizona array.

Kazakhstan

Florida

Where would you

Oklahoma

Mass.

Washington

Iowa

New

Hampshire

West

Virginia

Arkansas

Arizona array.

Florida

Kazakhstan is the

new right child

of Iowa?

Oklahoma

Mass.

Washington

Iowa

New

Hampshire

West

Virginia

Arkansas

Kazakhstan

• Given a complete tree of N items, the depth D = O(log N).

• What is the maximum number of nodes tested to add an item to the binary search tree if we use a complete tree?

• What is the maximum number of nodes tested (worst case) to add an item from a binary search tree that is not complete or balanced?

Arizona array.

Removing an Item with a Given Key

Florida

• Find the item.

• If necessary, swap the item with one that is easier to remove.

• Remove the item.

Oklahoma

Mass.

Washington

Iowa

New

Hampshire

West

Virginia

Arkansas

Kazakhstan

Arizona array.

Removing 'Florida'

Florida

• Find the item.

Oklahoma

Mass.

Washington

Iowa

New

Hampshire

West

Virginia

Arkansas

Kazakhstan

Arizona array.

Removing 'Florida'

Florida

Oklahoma

Mass.

Florida cannot be

removed at the

moment...

Washington

Iowa

New

Hampshire

West

Virginia

Arkansas

Kazakhstan

Arizona array.

Removing 'Florida'

Oklahoma

Mass.

... because removing

Florida would

break the tree into

two pieces.

Washington

Iowa

New

Hampshire

West

Virginia

Arkansas

Kazakhstan

Arizona array.

Removing 'Florida'

Florida

• If necessary, do some rearranging.

Oklahoma

Mass.

The problem of

breaking the tree

happens because

Florida has 2 children.

Washington

Iowa

New

Hampshire

West

Virginia

Arkansas

Kazakhstan

Arizona array.

Removing 'Florida'

Florida

If necessary, do some rearranging.

Oklahoma

Mass.

For the rearranging,

take the smallest item

in the right subtree...

Washington

Iowa

New

Hampshire

West

Virginia

Arkansas

Kazakhstan

Iowa array.

Arizona

Removing 'Florida'

If necessary, do some rearranging.

Oklahoma

Mass.

...copy that smallest

item onto the item

that we're removing...

Washington

Iowa

New

Hampshire

West

Virginia

Arkansas

Kazakhstan

Iowa array.

Arizona

Removing 'Florida'

If necessary, do some rearranging.

Oklahoma

Mass.

... and then remove

the extra copy of the

item we copied...

Washington

New

Hampshire

West

Virginia

Arkansas

Kazakhstan

Iowa array.

Arizona

Removing 'Florida'

If necessary, do some rearranging.

Oklahoma

Mass.

Washington

... and reconnect

the tree

Kazakhstan

New

Hampshire

West

Virginia

Arkansas

Arizona array.

Removing 'Florida'

Florida

Oklahoma

Mass.

Why did we choose

the smallestitem

in the right subtree?

Washington

New

Hampshire

West

Virginia

Arkansas

Kazakhstan

Arizona array.

Removing 'Florida'

Iowa

Oklahoma

Mass.

Washington

Because every key

must be smaller than

the keys in its

right subtree

Kazakhstan

New

Hampshire

West

Virginia

Arkansas

• Find the item.

• If the item has a right child, rearrange the tree:

• Find smallest item in the right subtree

• Copy that smallest item onto the one that you want to remove

• Remove the extra copy of the smallest item (making sure that you keep the tree connected)

• else just remove the item.

Summary array.

• Binary search trees are a good implementation of data types such as sets, bags, and dictionaries.

• Searching for an item is generally quick since you move from the root to the item, without looking at many other items.

• Adding and deleting items is also quick.

• But as you'll see later, it is possible for the quickness to fail in some cases -- can you see why?