0% found this document useful (0 votes)

10 views102 pages

Lesson 9 - Trees (Compatibility Mode)

Uploaded by

shane ocampo

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

10 views102 pages

Lesson 9 - Trees (Compatibility Mode)

Uploaded by

shane ocampo

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 102

What is a tree?

 In computer science, a tree is an

abstract model of a hierarchical
structure.
 A tree consists of nodes with a parent-
child relation
 Applications:
 Organization charts
 File systems
 Programming environments

6/3/2017
Tree Terminology
 Root: node without parent (A)
 Internal node: node with at least
one child (A, B, C, F)
 External node (a.k.a. leaf ): node
without children (E, I, J, K, G, H,
D)
 Ancestors of a node: parent,
grandparent, grand-grandparent,
etc.
 Depth of a node: number of
ancestors
 Height of a tree: maximum depth
of any node (3)
 Descendant of a node: child,
grandchild, grand-grandchild,
etc.
 Subtree: tree consisting of a
node and its descendants

6/3/2017
Parts of a Tree
nodes

6/3/2017
Parts of a Tree
parent
node

6/3/2017
Parts of a Tree
parent child
node nodes

6/3/2017
Parts of a Tree
leaf
root node
nodes

6/3/2017
Parts of a Tree
sub-tree

6/3/2017
Binary Tree
• Each node can have at most 2 children

6/3/2017
Arithmetic Expression Tree
 Binary tree associated with an arithmetic expression
 internal nodes: operators
 external nodes: operands
 Example: arithmetic expression tree for the expression
(2 × (a − 1) + (3 × b))

6/3/2017
Tree Traversals
 Systematic
 Visit each node in a tree.

 Always do 3 things in some order

 Visit the current node
 Visit the left subtree
 Visit the right subtree

 Recursive
 Repeat the process at each node.

6/3/2017
Tree Traversals
 Preorder traversal:
 Visit the current node
 Visit the left subtree
 Visit the right subtree

 Inorder traversal:
 Visit the left subtree
 Visit the current node
 Visit the right subtree

 Postorder traversal:
 Visit the left subtree
 Visit the right subtree
 Visit the current node

6/3/2017
Inorder Traversal

6/3/2017
Preorder Traversal

6/3/2017
Postorder Traversal

6/3/2017
Tree Traversal Exercise
M

J S

D L R U

T
A E

6/3/2017
Binary Search Tree
A Binary Tree such that:
 Every node entry has a unique key.
 All the keys in the left subtree of a
node are less than the key of the node.
 All the keys in the right subtree of a
node are greater than the key of the
node.

6/3/2017
Example 1: key is an integer

31 64

20 40 56 89

28 33 47 59

6/3/2017
Insert
 Create new node for the item.
 Find a parent node.
 Attach new node as a leaf.

6/3/2017
Insert
57
Example:

31 64

20 40 56 89

28 33 47 59

6/3/2017
Insert
57
Example:

31 64

20 40 56 89

28 33 47 59

6/3/2017
Search: Checklist
 if target key is less than current node’s
key, search the left sub-tree.
 else, if target key is greater than current
node’s key, search the right sub-tree.
 returns:
 if found, pointer to node containing target
key.
 otherwise, NULL pointer.

6/3/2017
Search
Example: 59

31 64

20 40 56 89

28 33 47 59

57
found
6/3/2017 26
Search
Example: 61

31 64

20 40 56 89

28 33 47 59

57
failed
6/3/2017 27
Recall - Binary Search Tree
A Binary Tree such that:
 Every node entry has a unique key.
 All the keys in the left subtree of a
node are less than the key of the node.
 All the keys in the right subtree of a
node are greater than the key of the
node.

6/3/2017
Example 1: key is an integer

31 64

20 40 56 89

28 33 47 59

6/3/2017
Example 2: key is a string

Fred

Dan Mary

Alan Eve Kate Sue

Bill Eric Greg Len

6/3/2017
Binary Tree Node

entry

link to right
link to left
child node
child node

6/3/2017
Binary Search Tree Node

6/3/2017
Recall: •Allows strings of
arbitrary length.
•Memory needs to be
allocated dynamically
before use.
struct TreeNodeRec
{ •Use strcmp to
char* key; compare strings.

struct TreeNodeRec* leftPtr;

struct TreeNodeRec* rightPtr;
};

typedef struct TreeNodeRec TreeNode;

6/3/2017
6/3/2017
Book Record

struct BookRec
{ key
char* author;
char* title;
char* publisher;

/* etc.: other book information. */

};

typedef struct BookRec Book;

6/3/2017
Example 4: Binary Search Tree Node

struct TreeNodeRec
{
Book info;

struct TreeNodeRec* leftPtr;

struct TreeNodeRec* rightPtr;
};

typedef struct TreeNodeRec TreeNode;

6/3/2017
Tree Node

struct TreeNodeRec
{
float key;

struct TreeNodeRec* leftPtr;

struct TreeNodeRec* rightPtr;
};

typedef struct TreeNodeRec TreeNode;

6/3/2017
#ifndef TREEH
#define TREEH

struct TreeNodeRec
{
float key;
struct TreeNodeRec* leftPtr;
struct TreeNodeRec* rightPtr;
};

typedef struct TreeNodeRec TreeNode;

TreeNode* makeTreeNode(float value);

TreeNode* insert(TreeNode* nodePtr, float item);
TreeNode* search(TreeNode* nodePtr, float item);
void printInorder(const TreeNode* nodePtr);
void printPreorder(const TreeNode* nodePtr);
void printPostorder(const TreeNode* nodePtr);

#endif
6/3/2017
MakeNode
 parameter: item to be inserted
 steps:
 allocate memory for the new node
 check if memory allocation is successful
 if so, put item into the new node
 set left and right branches to NULL
 returns: pointer to (i.e. address of) new
node

6/3/2017
TreeNode* makeTreeNode(float value)
{
TreeNode* newNodePtr = NULL;

newNodePtr = (TreeNode*)malloc(sizeof(TreeNode));

if (newNodePtr == NULL)
{
fprintf(stderr, “Out of memory\n”);
exit(1);
}
else
{
newNodePtr->key = value;
newNodePtr->leftPtr = NULL;
newNodePtr->rightPtr = NULL;
}
return newNodePtr;
}

6/3/2017
value 3.3
newNodePtr NULL

newNodePtr 0x2000 0x2000

newNodePtr 0x2000 0x2000 3.3

NULL NULL

6/3/2017
Inorder
 Inorder traversal of a Binary Search Tree
always gives the sorted order of the keys.

void printInorder(TreeNode* nodePtr)

{

traverse left sub-tree

visit the node
traverse right sub-tree initially, pointer
to root node
}

6/3/2017
Inorder
 Inorder traversal of a Binary Search Tree
always gives the sorted order of the keys.

void printInorder(TreeNode* nodePtr)

{
if (nodePtr != NULL)
{
printInorder(nodePtr->leftPtr);
printf(“ %f”, nodePtr->key);
printInorder(nodePtr->rightPtr);
}
}

6/3/2017
Inorder
nodePtr