Chandigarh School of Business, Jhanjeri

Department of Computer Applications

Program Name: BCA/BSC CS/BSC IT/ BSC GWD

Course Code: UGCC2510
Course Name: Data Structures-II

Prepared by: Ms. Simranjit Kaur

Department of Computer Application 1

 Outlines

• PTU Syllabus of Unit-I

• CO’s Introduction
• Topic Overview
• Brief description of what the presentation will cover
• Importance or relevance of the topic
• Key objectives or learning outcomes
• Summary
• References

Department of Computer Application 2

 PTU Syllabus of Unit-I

UNIT I:
Trees: Definition, Terminologies, Binary Trees, Memory
representation of Tress using Array
and Linked List, Recursive and non-recursive Traversal of Binary
Tree, Threaded Binary Tree,
Binary Search Tree, Inserting, Deleting and Searching in Binary
Search Tree.

Department of Computer Application 3

 Key objectives or
learning outcomes

•Understand the basic concepts and terminology of trees.

•Comprehend different types of trees with emphasis on binary trees.

•Learn how trees are represented in memory.

•Master traversal techniques for binary trees.

•Explore advanced binary tree structures.

•Gain proficiency in Binary Search Tree operations.

4
 CO Introduction
CO NUMBER CO1 1 (Remembering)
• Trees
• Definition, Terminologies of Trees
• Binary Trees
• Memory representation of Trees using Array
• Memory representation of Trees using Linked List
• Recursive and non-recursive Traversal of Binary Tree
• Threaded Binary Tree
• Binary Search Tree
• Inserting, Deleting and Searching in Binary Search Tree.

Department of Computer Application 5

 Topic Overview

Data structures are organized ways to store, manage, and retrieve data
efficiently, enabling effective data manipulation and optimized performance
in software applications. They range from simple linear structures like
arrays and linked lists, which store elements sequentially, to complex non-
linear structures like trees and graphs that model hierarchical and network
relationships. Each data structure supports specific operations such as
insertion, deletion, traversal, and searching, and choosing the right one is
essential for solving problems efficiently and improving algorithm
performance.

Department of Computer Application 6

 Brief of what the presentation
will

• Introduction of Data Structures

• Features of Data Structures
• Types of Data Structures
• Primitive and Non-Primitive Data Structures

Department of Computer Application 7

 Introduction to Data Structure

⮚Computer is an electronic machine which is used for data processing and

manipulation.
⮚When programmer collects such type of data for processing, he would require
to store all of them in computers main memory.
⮚In order to make how computer work we need to know
Representation of data in computer.
Accessing of data.
How to solve problem step by step.
⮚For doing all of this task we used Data Structure

Department of Computer Application 8

What is Data Structure?
⮚ A data structure is a specialized
format for organizing, processing,
retrieving and storing data.
⮚ In computer programming, a data
structure may be selected or
designed to store data for the
purpose of working on it with
various algorithms.

9
 Data Structure
• A data structure is a particular way of organizing data in a
computer so that it can be used effectively.
• For example, we can store a list of items having the same data-
type using the array data structure.

Department of Computer Applications 10

 Features of Data Structures
•Organization of Data:
•Data structures organize data in a systematic way to enable efficient access and modification.
•Data Storage:
•They provide a way to store data in memory or on disk effectively.
•Data Retrieval:
•Facilitate fast and efficient retrieval of data according to different access patterns.
•Data Manipulation:
•Support operations such as insertion, deletion, updating, and traversal of data elements.
•Abstraction:
•Provide a logical view of data, hiding the implementation details from the user.
•Efficiency:
•Aim to minimize the use of time and space during data processing.
•Reusability:
•Many data structures can be reused across different programs or problems.
•Data Integrity:
•Help maintain consistent and accurate data through controlled access and modifications.
•Flexibility:
•Support dynamic resizing (in some cases), allowing growth and shrinkage of data as needed.
•Relationships:
•Represent relationships between data elements (e.g., parent-child in trees, connections in graphs).

11
 Data Structure
⮚ The representation of particular data structure in the main memory of a computer is called as storage
structure.
⮚ The storage structure representation in auxiliary memory is called as file structure.
⮚ It is define as the way of storing and manipulating data in organized form so that it can be used
efficiently
⮚ Data Structure mainly specifies the following four things:
1)organization of data 2)accessing method 3)degree of associativity 4) processing alternative for
information
⮚ Algorithm + Data Structure = Program
⮚ Data Structure study Covers the following points
1) Amount of memory require to store
2) Amount of time require to process
3) Representation of data in memory
4) Operations performs on data

Department of Computer Applications 12

Types Of Data Structures

Department of Computer Application 13

 DATA TYPES
• A particular kind of data item, as defined by the values it can take, the Programming
language used, or the operations that can be performed on it.
• Primitive Data Structure
Primitive Data Structure are basic structure and directly operated upon by machine
instructions.
Primitive data structures have different representations on different computers.
Integers, floats, character and pointers are example of primitive data structures.
These data types are available in most programming languages as built in type.
Integer: It is a data type which allows all values without fraction part. We can used it for
whole numbers.
Float: It is a data type which is use for storing fraction numbers.
Character: It is a data type which is used for character values.
Pointer: A variable that hold memory address of another variable are called pointer.

Department of Computer Application 14

 Non Primitive Data Type
• These are more sophisticated data structures.
• These are derived from primitive data structure.
• The non – primitive data structures emphasize structuring of a group of
homogeneous or heterogeneous data items. \
• Example of non – primitive data types are Array, List, and File etc.
• A non – primitive data type is further divided into Linear and non – Linear data
structure.
Array: An array is a fixed size sequenced collection of elements of the same data
type.
List: An ordered set containing variable number of elements is called as List.
File: A file is a collection of logically related information. It can be viewed as a large
list of records consisting of various fields.

Department of Computer Application 15

 Summary

⮚ A data structure is a specialized format for organizing, processing, retrieving and storing
data.
⮚ It is widely used in Efficient Data Management, Data Retrieval, Memory Optimization,
Database Management and so on.
⮚ Primitive data structures emphasize structuring of a group of homogeneous or
heterogeneous data items.
⮚ A non – primitive data type is further divided into Linear and non – Linear data structure.

Department of Computer Application 16

 References

Books References
• Data Structures and Algorithms in Java by
Michael T. Goodrich; Roberto Tamassia; Michael H. Goldwasser; Subhasish Banerjee (6th Edition).

• E-book link
https://www.mta.ca/~rrosebru/oldcourse/263114/Dsa.pdf

• YouTube link
https://www.youtube.com/watch?v=4_HOnhB64Dg

• Web link
https://www.geeksforgeeks.org/introduction-to-binary-tree/

Department of Computer Application 17

THANK YOU

Department of Computer Application 18