0% found this document useful (0 votes)
5 views12 pages

Chapter 3 - Trees

Chapter 3 discusses trees as a non-linear data structure that imposes a hierarchical organization on data. It highlights practical applications such as organizational charts, family hierarchies, and the representation of algebraic expressions. The chapter also includes examples of binary trees and their uses in converting algebraic expressions.

Uploaded by

Nur Tra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views12 pages

Chapter 3 - Trees

Chapter 3 discusses trees as a non-linear data structure that imposes a hierarchical organization on data. It highlights practical applications such as organizational charts, family hierarchies, and the representation of algebraic expressions. The chapter also includes examples of binary trees and their uses in converting algebraic expressions.

Uploaded by

Nur Tra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Data Structure

and Algorithms
Chapter 3

Trees
 Data structure such as Arrays, Stacks, Linked
List and Queues are linear data structure.
Elements are arranged in linear manner i.e.
one after another.
 Tree is a non-linear data structure.
Introduction  Tree imposes a Hierarchical structure, on a
collection of items.
 Several Practical applications
 Organization charts.
 Family hierarchy
 Representation of algebraic expression
Example

Organizational
Chart
Example - Unix / Windows file structure
Directory
onverting Algebraic
Expression into
Binary Tree
/Expression Tree
Draw
Binary Tree
Draw
Binary Tree
Draw
Binary Tree
Draw
Binary Tree
Draw
Binary Tree
Draw
Binary Tree
END

You might also like