Scribd
Upload
64 views12 pages

Trees in Data Structure

Trees are hierarchical data structures that store information in a parent-child relationship. A tree contains nodes connected by edges. It is a nonlinear structure compared to arrays and linked lists. The key aspects of trees include the root node, parent and child nodes, siblings, paths, heights, depths, edges, and leaf nodes. Trees enable efficient insertion and searching operations and allow flexible movement of subtrees. Common tree types include binary trees, binary search trees, AVL trees, and B-trees.

Uploaded by

maaz
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
64 views12 pages

Trees in Data Structure

Trees are hierarchical data structures that store information in a parent-child relationship. A tree contains nodes connected by edges. It is a nonlinear structure compared to arrays and linked lists. The key aspects of trees include the root node, parent and child nodes, siblings, paths, heights, depths, edges, and leaf nodes. Trees enable efficient insertion and searching operations and allow flexible movement of subtrees. Common tree types include binary trees, binary search trees, AVL trees, and B-trees.

Uploaded by

maaz
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

Lecture 18

Trees in Data Structure


What are trees?

 Tree is a hierarchical data structure which stores the


information naturally in the form of hierarchy style.
 Tree is one of the most powerful and advanced data
structures.
 It is a non-linear data structure compared to arrays,
linked lists, stack and queue.
 It represents the nodes connected by edges.
Tree example
 The above figure represents structure of a tree. Tree has
2 sub trees.
 A is a parent of B and C.
 B is called a child of A and also parent of D, E, F.

 Tree is a collection of elements called Nodes, where


each node can have arbitrary number of children.
Field Description
Root Node Root is a special node in a tree. The entire tree is
referenced through it. It does not have a parent.

Parent Node Parent node is an immediate predecessor of a


node.
Child Node All immediate successors of a node are its children.

Siblings Nodes with the same parent are called Siblings.

Path Path is a number of successive edges from source


node to destination node.
Height of Node Height of a node represents the number of edges
on the longest path between that node and a leaf.

Depth of Node Depth of a node represents the number of edges


from the tree's root node to the node.

Edge Edge is a connection between one node to


another. It is a line between two nodes or a node
and a leaf.

Leaf Node Nodes with no children are called leaves


Advantages of Tree

 Tree reflects structural relationships in the data.


 It is used to represent hierarchies.
 It provides an efficient insertion and searching
operations.
 Trees are flexible. It allows to move sub trees around with
minimum effort.
Types of trees

 Binary Trees
 Binary Search Tree
 AVL Tree
 B-Tree
Binary Tree

 A tree is said to be binary tree when,

1. A binary tree has a root node.

2. A root node may have one or two child nodes. Each


node forms a binary tree itself.

3. The number of child nodes cannot be more than two.

4. It has a unique path from the root to every other


node.
Types of Binary Tree

 There are four types of binary tree:

1. Full Binary Tree


2. Complete Binary Tree
3. Skewed Binary Tree
4. Extended Binary Tree
Full Binary Tree
 If each node of binary tree has either two children or no child at all, is said
to be a Full Binary Tree.
 Full binary tree is also called as Strictly Binary Tree.

Every node in the tree has either 0 or 2 children.


Full binary tree is used to represent mathematical expressions
Complete Binary Tree

 A binary tree which has all levels of tree are completely filled- except last
level
 last level must also be filled from left to right

You might also like