Trees in Data Structure

UNIT-3
NON-LINEAR DATA
STRUCTURE
TREE

Darshan Institute of Engineering &
Technology, Rajkot

,AGENDA
🞂 Introduction to tree
🞂 Representations of tree
🞂 Properties of trees
🞂 Binary tree
⮩ Binary tree representation
⮩ Binary tree properties
⮩ Binary tree traversals (inorder,preorder,postorder)
⮩ Binary tree implementation
⮩ Threaded Binary Tree

🞂 Binary Search Tree
🞂 Conversion of General Tree to Binary Tree
🞂 Application of trees
🞂 Balanced tree mechanism
⮩ AVL Tree, 2-3 trees

🞂 Height Balance, Weight balance
#3130702 (DS) ⬥ Unit 3 – Non-Linear Data Structure
Dr. Pradyumansinh U. Jadeja
(Tree Part-1)

,INTRODUCTION TO TREES
🞂 In linear data structure data is organized in sequential order and in no
data structure data is organized in random order. A tree is a very popu
linear data structure used in a wide range of applications.
🞂 Tree is a non-linear data structure which organizes data in hier
structure and this is a recursive definition.
🞂 In tree data structure, every individual element is called as Node. Node
data structure stores the actual data of that particular element and link
element in hierarchical structure.




#3130702 (DS) ⬥ Unit 3 – Non-Linear Data Structure
Dr. Pradyumansinh U. Jadeja
(Tree Part-1)

, TREE TERMINOLOGY




#3130702 (DS) ⬥ Unit 3 – Non-Linear Data Structure
Dr. Pradyumansinh U. Jadeja
(Tree Part-1)