Discrete Structures - CSIS121
Transcript of Discrete Structures - CSIS121
![Page 1: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/1.jpg)
Discrete Mathematics – CIS166
TextDiscrete Mathematics and Its
Applications (5th Edition)
Kenneth H. Rosen
Chapter 9: TreesBy Chuck Allison
Modified by Longin Jan Latecki,Temple University
![Page 2: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/2.jpg)
Section 9.1
Introduction to Trees
![Page 3: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/3.jpg)
Definition:
A tree is a connected undirected graph with no simple circuits.
Recall: A circuit is a path of length >=1 that begins and ends a the same vertex.
![Page 4: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/4.jpg)
d
d
![Page 5: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/5.jpg)
Tournament TreesA common form of tree used in everyday life is the tournament tree, used to describe the outcome of a series of games, such as a tennis tournament.
AliceAntoniaAnitaAbigailAmyAgnesAngelaAudrey
Alice
Abigail
Agnes
Angela
Alice
Angela
Alice
![Page 6: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/6.jpg)
A Family Tree
Much of the tree terminology derives from family trees.
Gaea
Cronus Phoebe Ocean
Zeus Poseidon Demeter Pluto Leto Iapetus
Persephone Apollo Atlas Prometheus
![Page 7: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/7.jpg)
Ancestor Tree
An inverted family tree. Important point - it is a binary tree.
Iphigenia
Clytemnestra Agamemnon
Leda Tyndareus Aerope Atreus
Catreus
![Page 8: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/8.jpg)
ForestGraphs containing no simple circuits that are not connected, but each connected component is a tree.
![Page 9: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/9.jpg)
Theorem
An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.
![Page 10: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/10.jpg)
Rooted Trees
Once a vertex of a tree has been designated as the root of the tree, it is possible to assign direction to each of the edges.
![Page 11: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/11.jpg)
Rooted Trees
a
b
c
d
e f
ga
bc
d
e
f
g
![Page 12: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/12.jpg)
root nodea
b c
d e f g
h i
parent of g
siblingsleaf
internal vertex
![Page 13: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/13.jpg)
a
b c
d e f g
h i ancestors of h and i
![Page 14: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/14.jpg)
a
b c
d e f g
h isubtree with b as its rootsubtree with c as its root
![Page 15: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/15.jpg)
m-ary treesA rooted tree is called an m-ary tree if every internal vertex has no more than m children. The tree is called a full m-ary tree if every internal vertex has exactly m children. An m-ary tree with m=2 is called a binary tree.
![Page 16: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/16.jpg)
![Page 17: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/17.jpg)
Ordered Rooted Tree
An ordered rooted tree is a rooted tree where the children of each internal vertex are ordered. Ordered trees are drawn so that the children of each internal vertex are shown in order from left to right.
![Page 18: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/18.jpg)
Properties of Trees
A tree with n vertices has n-1 edges.
![Page 19: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/19.jpg)
Properties of TreesA full m-ary tree with i internal vertices contains n = mi+1 vertices.
![Page 20: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/20.jpg)
Properties of Trees
A full m-ary tree with
(i) n vertices has i = (n-1)/m internal vertices and l = [(m-1)n+1]/m leaves.
(ii) i internal vertices has n = mi + 1 vertices and l = (m-1)i + 1 leaves.
(iii) l leaves has n = (ml - 1)/(m-1) vertices and i = (l-1)/(m-1) internal vertices.
![Page 21: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/21.jpg)
Proof We know n = mi+1 (previous theorem)
and n = l+i, n – no. vertices i – no. internal vertices l – no. leaves For example, i = (n-1)/m
![Page 22: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/22.jpg)
Properties of Trees
The level of a vertex v in a rooted tree is the length of the unique path from the root to this vertex.
level 2
level 3
![Page 23: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/23.jpg)
Properties of Trees
The height of a rooted tree is the maximum of the levels of vertices.
![Page 24: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/24.jpg)
Properties of Trees
A rooted m-ary tree of height h is called balanced if all leaves are at levels h or h-1.
![Page 25: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/25.jpg)
Properties of Trees
There are at most mh leaves in an m-ary tree of height h.
![Page 26: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/26.jpg)
Properties of Trees
If an m-ary tree of height h has l leaves, then h lm lo g
![Page 27: Discrete Structures - CSIS121](https://reader036.fdocuments.us/reader036/viewer/2022062401/586b718f1a28abb7788bd1fa/html5/thumbnails/27.jpg)
Proof From previous theorem:
hlhlml mmh loglog