11
Trees
LEARNING OBJECTIVES
After reading this chapter, you will be conversant with:
- Introduction
- Rooted Structure
- Binary Tree of An Algebraic Expression
- Tree Searching or Tree Traversal
- Binary Search Tree
- Spanning Trees
- Minimal Spanning Trees
11.1 INTRODUCTION
One of the most important class of graphs are trees that are extensively used in computer science, switching network, corporate management, business, and educational organizations.
A corporate management structure can be presented as follows:
Thus, a tree is a simple graph having no loops and no parallel edges.
11.1.1 Definition
A graph is acyclic if it has no cycles. A tree is a connected ...
Get Discrete Mathematical Structures now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
