Data Abstraction and Structures Using C++Headington and Riley Chapter 13Trees

2/24/99

Click here to start

Table of Contents

Data Abstraction and Structures Using C++Headington and Riley Chapter 13Trees

Hierarchical Structure of theCommunity Colleges of Baltimore County

A Tree is a Hierarchical Structure

How many leaf nodes?

How many descendants of Q?

How many ancestors of K?

Implementing a Binary Tree with Pointers and Dynamic Data

A Binary Expression Tree

A Binary Expression Tree is . . .

Evaluate this binary expression tree

A binary expression tree

Each node contains two pointers

Or, using a class for nodes

class ExprTree from Roberge Lab 11

A Binary Search Tree (BST) is . . .

Shape of a binary search tree . . .

Inserting ‘E’ into the BST

Inserting ‘F’ into the BST

Inserting ‘T’ into the BST

Inserting ‘A’ into the BST

What binary search tree . . .

Binary search tree . . .

Another binary search tree

Is ‘F’ in the binary search tree?

Each node contains two pointers

class CharBSTree

Author: Sylvia Sorkin

Email: ssorkin@essex.cc.md.us

Home Page: http://www.essex.cc.md.us/Essex/People/ssorkin/index.html

Download presentation source