Lecture 6

Outline
Trees
Binary Trees
Computer Science 3A - CSC3A10

Lecture 6: Trees
Dr. DT van der Haar
Academy of Computer Science and Software Engineering
University of Johannesburg
1/53
Outline
Trees
Binary Trees
Trees
Tree Definition
Tree ADT
Linked Structure for Trees
Traversals
Binary Trees
Binary Tree Definition
Binary Tree Examples
Binary Tree ADT
Binary Tree Properties
Linked Structure for Binary Trees
Array-Based Implementation of Binary Trees
Preorder Traversal of a Binary Tree
Postorder Traversal of a Binary Tree
Evaluate Arithmetic Expressions
Inorder Traversal of Binary Tree
2/53
Outline
Trees
Binary Trees
Euler Tour Traversal of a Binary Tree

Print Arithmetic Expressions
Exercises
3/53
Outline
Trees
Binary Trees
Trees
4/53
Outline
Trees
Binary Trees
Tree Definition
Tree Definition
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
5/53
Outline
Trees
Binary Trees
Tree Definition
Tree Definition II
6/53
Outline
Trees
Binary Trees
Tree Definition
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.
Descendant of a node - child, grandchild, grand-grandchild,
etc.
Subtree - tree consisting of a node and its descendants
Edge - Pair of nodes (u,v) where u is the parent of v, or vice
versa
Path - Sequence of nodes such that any two consecutive
nodes in the sequence form an edge
7/53
Outline
Trees
Binary Trees
Tree Definition
Tree Terminology II
8/53
Outline
Trees
Binary Trees
Tree Definition
Tree Terminology III
Depth of node v is the number of ancestors of v excluding v .

Defined recursively as:
1 I f v i s root
2
depth of v i s 0
3 E l s e d e p t h o f v i s 1+d e p t h ( p a r e n t ( v ) )
Depth of node v
9/53
Outline
Trees
Binary Trees
Tree Definition
Tree Terminology IV
Height of a tree is defined recursively as:

1 I f v i s an e x t e r n a l node
2
height of v i s 0
3 E l s e h e i g h t o f v i s 1+max ( h e i g h t ( c h i l d ( v ) ) )
Height of tree
10/53
Outline
Trees
Binary Trees
Tree ADT
Tree ADT
We use positions to abstract nodes, where Positions are defined
relative to neighbouring position.
Generic methods:
integer size()
boolean isEmpty()
Iterator elements()
Iterator positions()
Accessor methods:
position root()
position parent(p)
positionIterator children(p)
11/53
Outline
Trees
Binary Trees
Tree ADT
Tree ADT II
Query methods:
boolean isInternal(p)
boolean isExternal(p)
boolean isRoot(p)
Update methods:
Object replace(p,o)
Update methods may be defined by data structures implementing
the Tree ADT
12/53
Outline
Trees
Binary Trees
A node is represented by an object storing:

Element
Parent node
Sequence of children nodes
Node objects implement the Position ADT
13/53
Outline
Trees
Binary Trees
Linked Structure for Trees II
14/53
Outline
Trees
Binary Trees
Linked Structure for Trees III
15/53
Outline
Trees
Binary Trees
Traversals
Preorder Traversal
A traversal is a systematic way of accessing or visiting all the

nodes of a tree
In a preorder traversal, a node is visited before its descendants
Application: print a structured document. See Example 7.6,
pg. 277
16/53
Outline
Trees
Binary Trees
Traversals
Preorder Traversal II
1 Algorithm preOrder ( v )
2
visit (v)
3
f o r each c h i l d w of v
4
p r e o r d e r (w)
preOrder Traversal
17/53
Outline
Trees
Binary Trees
Traversals
Preorder Traversal III
18/53
Outline
Trees
Binary Trees
Traversals
Postorder Traversal
In a postorder traversal, a node is visited after its descendants

Application: compute space used by files in a directory and its
subdirectories. See Example 7.7, pg. 280
19/53
Outline
Trees
Binary Trees
Traversals
Postorder Traversal II
1 Algorithm postOrder ( v )
2 f o r each c h i l d w of v
3
p o s t O r d e r (w)
4 visit (v)
preOrder Traversal
20/53
Outline
Trees
Binary Trees
Traversals
Postorder Traversal III
21/53
Outline
Trees
Binary Trees
Binary Trees
22/53
Outline
Trees
Binary Trees
Binary Tree Defintion
A binary tree is a tree with the following properties:

Each internal node has at most two children (exactly two for
proper binary trees)
The children of a node are an ordered pair
We call the children of an internal node left child and right child
23/53
Outline
Trees
Binary Trees
Binary Tree Defintion II
Alternative recursive definition:

a tree consisting of a single node (root), or
a tree whose root has an ordered pair of children, each of
which is a binary tree
Applications include:
arithmetic expressions
decision processes
searching
24/53
Outline
Trees
Binary Trees
Arithmetic Expression Tree
Binary tree associated with an arithmetic expression

internal nodes: operators
external nodes: operands
25/53
Outline
Trees
Binary Trees
Arithmetic Expression Tree II

Example: Arithmetic expression tree for the expression
(2 (a 1)) + (3 b)
26/53
Outline
Trees
Binary Trees
Decision Tree
Binary tree associated with a decision process

internal nodes: questions with yes/no answer
external nodes: decisions
27/53
Outline
Trees
Binary Trees
Decision Tree II
Example: dining decision
28/53
Outline
Trees
Binary Trees
Binary Tree ADT
Binary Tree ADT
The BinaryTree ADT extends the Tree ADT i.e. it inherits all the
methods of the Tree ADT. The additional methods include:
position left(p)
position right(p)
boolean hasLeft(p)
boolean hasRight(p)
Update methods may be defined by data structures implementing
the BinaryTree ADT
29/53
Outline
Trees
Binary Trees
Properties:
Notation:
n - number of nodes
e - number of external
nodes
i - number of internal
nodes
h - height
30/53
e =i +1
n = 2e 1
hi
h (n 1)/2
e 2h
h log2 e
h log2 (n + 1) 1
Outline
Trees
Binary Trees
Binary Tree Properties II
31/53
Outline
Trees
Binary Trees
A node is represented by an object storing:

Element
Parent node
Left child node
Right child node
Node objects implement the Position ADT
32/53
Outline
Trees
Binary Trees
Linked Structure for Binary Trees II
33/53
Outline
Trees
Binary Trees
Nodes are stored in an array
34/53
Outline
Trees
Binary Trees
Array-Based Implementation of Binary Trees II
Let rank(node) be defined as follwos:

rank(root) = 1
if node is the left child of parent(node)
rank(node) = 2*rank(parent(node))
if node is the right child of parent(node)

rank(node) = 2*rank(parent(node))+1
35/53
Outline
Trees
Binary Trees
Array-Based Implementation of Binary Trees III
36/53
Outline
Trees
Binary Trees
1
2
3
4
5
6
A l g o r i t h m b i n a r y P r e O r d e r (T , v )
visit (v)
i f hasLeft (v)
b i n a r y P r e O r d e r (T , l e f t ( v ) )
i f hasRight ( v )
b i n a r y P r e O r d e r (T , r i g h t ( v ) )
Preorder traversal of a binary tree
37/53
Outline
Trees
Binary Trees
1
2
3
4
5
6
A l g o r i t h m b i n a r y P o s t O r d e r (T , v )
i f hasLeft (v)
b i n a r y P o s t O r d e r (T , l e f t ( v ) )
i f hasRight ( v )
b i n a r y P o s t O r d e r (T , r i g h t ( v ) )
visit (v)
Postorder traversal of a binary tree
38/53
Outline
Trees
Binary Trees
Specialization of a postorder traversal

recursive method returning the value of a subtree
when visiting an internal node, combine the values of the
subtrees
39/53
Outline
Trees
Binary Trees
Evaluate Arithmetic Expressions II
40/53
Outline
Trees
Binary Trees
Evaluate Arithmetic Expressions III
1
2
3
4
5
6
7
8
Algorithm evalExpr ( v )
if isExternal (v)
return v . element ()
else
x = evalExpr ( l e f t C h i l d (v) )
y = evalExpr ( rightChild (v) )
op = o p e r a t o r s t o r e d a t v
r e t u r n x op y
Evaluating expressions using a binary tree
41/53
Outline
Trees
Binary Trees
In an inorder traversal a node is visited after its left subtree and

before its right subtree.
Application: draw a binary tree:
x(v) = inorder rank of v
y(v) = depth of v
42/53
Outline
Trees
Binary Trees
Inorder Traversal of Binary Tree II
43/53
Outline
Trees
Binary Trees
Inorder Traversal of Binary Tree III
1
2
3
4
5
6
Algorithm inOrder ( v )
i f hasLeft (v)
inOrder ( l e f t ( v ) )
visit (v)
i f hasRight ( v )
inOrder ( r i g h t ( v ) )
Inorder Traversal
44/53
Outline
Trees
Binary Trees

Generic traversal of a binary tree. Includes the special cases for the
following traversals
Preorder
postorder
Inorder
Walk around the tree and visit each node three times:
on the left (preorder)
from below (inorder)
on the right (postorder)
45/53
Outline
Trees
Binary Trees
Euler Tour Traversal of a Binary Tree II
46/53
Outline
Trees
Binary Trees
Euler Tour Traversal of a Binary Tree III
1
2
3
4
5
6
7
8
A l g o r i t h m E u l e r T o u r (T , v )
v i s i t L e f t (T , v )
i f T. hasLeft ( v )
E u l e r T o u r (T , l e f t ( v ) )
v i s i t B e l o w (T , v )
i f T. hasRight ( v )
E u l e r T o u r (T , r i g h t ( v ) )
v i s i t R i g h t (T , v )
Euler Tour Traversal
47/53
Outline
Trees
Binary Trees
Specialization of Euler tour traversal

On the left - if the node is internal then print (
From below - print the value or operator stored in node
On the right - if the node is internal then print )
48/53
Outline
Trees
Binary Trees
Euler Tour Traversal of a Binary Tree II

(2 (a 1)) + (3 b)
49/53
(1)
Outline
Trees
Binary Trees
Euler Tour Traversal of a Binary Tree III
1
2
3
4
5
6
7
8
9
10
11
A l g o r i t h m p r i n t E x p r e s s i o n (T , v )
i f T. i s I n t e r n a l ( v )
print ( ( )
p r i n t E x p r e s s i o n (T , T . l e f t ( v ) )
p r i n t the operator or value stored at v
p r i n t E x p r e s s i o n (T , T . r i g h t ( v ) )
print ( ) )
Euler Tour Print Expression
50/53
Outline
Trees
Binary Trees
Template Method Pattern
Generic algorithm that can be specialized by redefining certain

steps
Implemented by means of an abstract Java class
Visit methods that can be redefined by subclasses
Template method of Euler Tour:
Recursively called on the left and right children
A Result object with fields leftResult, rightResult and
finalResult keeps track of the output of the recursive calls to
eulerTour
51/53
Outline
Trees
Binary Trees
Template Method Pattern II
1
2
3
4
5
6
7
8
9
10
A l g o r i t h m t e m p l a t e E u l e r T o u r (T , v )
r = new o b j e c t o f t y p e T o u r R e s u l t
v i s i t L e f t (T , v , r )
r . l e f t = t e m p l a t e E u l e r T o u r (T , T . l e f t ( v ) )
v i s i t B e l o w (T , v , r )
r . r i g h t = t e m p l a t e E u l e r T o u r (T , T . r i g h t ( v ) )
v i s i t R i g h t (T , v , r )
return r . out
Template method pattern
52/53
Outline
Trees
Binary Trees
Exercises
Exercises
Reinforcement exercises:
R7.2
R7.10 - R7.14
R7.17
R7.20
Creativity exercises:
C7.1 - C7.7
C7.9
C7.12
C7.21
C7.24
C7.25
C7.28 - C7.30
53/53

Lecture 6

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lecture 6

Uploaded by

Copyright:

Available Formats

Outline

Computer Science 3A - CSC3A10

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Euler Tour Traversal of a Binary Tree

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

In computer science, a tree is an abstract model of a

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Academy of Computer Science and Software Engineering

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Tree Terminology III

Depth of node v is the number of ancestors of v excluding v .

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Height of a tree is defined recursively as:

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Academy of Computer Science and Software Engineering

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Linked Structure for Trees

Linked Structure for Trees

A node is represented by an object storing:

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Linked Structure for Trees

Linked Structure for Trees II

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Linked Structure for Trees

Linked Structure for Trees III

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

A traversal is a systematic way of accessing or visiting all the

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Preorder Traversal III

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

In a postorder traversal, a node is visited after its descendants

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Postorder Traversal III

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Computer Science 3A - CSC3A10

Academy of Computer Science and Software Engineering

Binary Tree Definition

Binary Tree Defintion

A binary tree is a tree with the following properties: