Tree Data Structure: Basics and Fundamentals

marceldavidbaroi 7 views 11 slides Mar 11, 2025
Slide 1
Slide 1 of 11
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10
Slide 11
11

About This Presentation

Explore the fundamentals of tree data structures, a crucial concept in computer science. This guide covers types of trees, key properties, traversal techniques, and real-world applications, making it ideal for beginners and developers looking to strengthen their understanding.


Slide Content

TREE Basic Presented By:

Important Terms A C B E D G F H I Root : The node at the top of the tree is called root. There is only one root per tree and one path from the root node to any node. root

A C B E D G F H I Parent : Any node except the root node has one edge upward to a node called parent. Parent Node

A C B E D G F H I Child : The node below a given node connected by its edge downward is called its child node. Child Node

A C B E D G F H I Siblings: The node which have same parent Siblings

A C B E D G F H I Leaf: The node which does not have any child node is called the leaf node. Leaf Node

A C B E D G F H I Sub-tree: Sub-tree represents the descendants of a node. Sub-tree H D I

A C B E D G F H I Levels: Level of a node represents the generation of a node. If the root node is at level 0, then its next child node is at level 1, its grandchild is at level 2, and so on. Level 0 Level 2 Level 1 Level 3

A C B E D G F H I Node A node is an entity that contains a key or value and pointers to its child nodes.

A C B E D G F H I Edge: It is the link between any two nodes .

Thank You