SlideShare ist ein Scribd-Unternehmen logo
1 von 86
Downloaden Sie, um offline zu lesen
DREAM VALLEY COLLEGE   FOR GIRLS CENTRE  FOR  EDUCATIONAL  EXECELLENCE ADD:-Near Railway spring factory, Sitholi , Gwalior (MP) AFFILATED TO:- JIWAJI UNIVERSITY (strictly according to jiwaji university)
PPT PRESENTATION  On DATA STRUCTURE BCA  2nd  semester PRESENTED BY GUIDED BY HARISH SIR
INDEX ARRAY LINKED LIST QUEUES TREES GRAPHS SEARCH IT OUT STACK ARRAY STACK LINKEDLIST QUEUES TREES GRAPHS -
[object Object],INTRODUCTION TO ARRAY
A B C F E D Array representation on memory OR  INSERTION OF ELEMENT IN THE ARRAY
operation performred on array ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
A B C D E F DELETION OF ELEMENT IN THE ARRAY Delete (F) from the array. Delete (E) from the array. Delete (D) from the array. Delete (C) from the array. Delete (B) from the array. Delete (A) from the array.
TREES IN DATA STRUCTURE DREAM VALLEY GROUP OF COLLEGE ADD-NEAR RAILWAY SPRING FACTORY QUARTERS PHONE-2469990
TREES IN DATA STRUCTURE PRESENTED BY- GUIDED BY- HARISH SIR PUJA AND SHAIFALI
TOPIC COVERED WHAT IS TREE ROLE OF TREE IN DATA STRUCTURE BUILDING A SIMPLE TREE TYPES OF TREES BUILDING A BINARY TREE INORDER PRE ORDER POST ORDER ARRAY LINKED LIST
WHAT IS TREE TREES BRANCHES LEAVES ETC
NATURE IS A MAN'S BEST TEACHER  IF YOU UNDRESTAND THE CONCEPT OF TREE IT MEANS SIMPLE TREE --> CHILD NODE <- ROOT NODE/PARENT NODE
BUT IN DATASTRUCTURE TREE IS CREATED LIKE THIS BUT IN  REVERSE FORM --> TREES IN REVERSE FORM -> child node <- root node
IN A TREE STRUCTURE,HOWEVER EACH NODE MAY POINT TO SEVERAL NODE.
Binary tree->binary tree is defined as finite set of node in which number of the children  of a node should not exceed more than two .it means  the degree of binary tree not then greater then two .
BINARY TREE A B C D E F G THIS IS A BINARY TREE ROOT NODE CHILD NODE BRANCHES
TYPES OF BINARY TREE STRICTLY BINARY TREE COMPLETE BINARY TREE EXTENDED BINARY TREE
In every non terminal node in a binary tree consists of non empty left subtree and right subtree ,then such a tree is called strictly binary tree . STRICTLY BINARY TREE
STRICTLY BINARY TREE A B D E C F G NON TERMINAL NON TERMINAL
Complete binary tree The level of all nodes  of complete binary tree is equal .
A B C D E F G complete binary tree 0 1 2 THESE ARE LEVEL OF COMPLETE BINARY TREE AND THE LEVEL OF THIS COMPLTE BINARY  TREE IS 2
building a binary tree element are to be added 20 7 26 8 18 6 28 20 20 is a root node of this tree > 7 7 is compared with 20 7 > 26 26 is compared with  20 26 7 AND 26 IS CHILD NODE OF THE ROOT TREE > 8 8 IS COMPARED TO 26 THEN COMPARED TO 7 > 8 8 > 6 6 IS COMPARED WITH 20 AND 7 > 6 6 < 18 < 18 18 18 IS COMPARED WITH 20 AND 26 > 28 > 28 28 IS COMPARED WITH 20 AND 26 28 THIS IS THE BUILDING OF BINARY TREE THEN.. TRAVERSAL OF A BINARY TREE
printing the data in in-order trversal ,[object Object],[object Object],[object Object],[object Object],A B C D E F G TRVERSE STARTS FROM THE ROOT NODE Since D is the leaf node ,it gets printed ,which is the left child of D. D Now B gets printed as it is the parent of the node D B Since E is the leaf node ,it gets printed ,which is right child of B   E Now A gets printed as it is the parent of the node B A Since F is the leaf node ,it gets printed ,which is the left child of c F Now C gets printed as it is the parent of the node F C Since G is leaf node ,it gets printed ,which the right child of C G In order traversal
Post -order traversal Printing the data in post-order traversal ,[object Object],[object Object],[object Object],[object Object],A B C D E F G Now A gets printed as it is the parent of the node B Now C gets printed as it is the parent of the node F Since D is the leaf node ,it gets printed ,which is the left child of D. TRVERSE STARTS FROM THE ROOT NODE Now B gets printed as it is the parent of the node D D E B Now F gets printed as it is the left child of C F G C A Since E is the leaf node ,it gets printed ,which is right child of B Now G gets printed ,as it is the right child of C
[object Object],[object Object],[object Object],[object Object],Pre-order traversal A B C D E F G Printing the data in pre-order traversal Traversal starts from the root node The data at the root node i.e. A gets printed A Since D is the leaf node ,it gets printed ,which is the left child of B. D Now B gets printed as it is the parent of the node D B Since E is the leaf node ,it gets printed , which is right child of B   E Now C gets printed as it is the parent of the node F C Since F is the leaf node ,it gets printed , which is the left child of c F Since G is leaf node ,it gets printed , which the right child of C G
Representation of a binary trees in memory ->there are two ways by which we can represent a binary tree LINKED LIST ARRAY ARRAY LINKED LIST
BINARY TREE CAN BE REPRESENTED BY LINKS WHERE EACH NODE   CONTAINS THE ADDRESS OF THE LEFT CHILD AND THE RIGHT CHILD
LINKED LIST REPRESENTATION LEFT DATA RIGHT NODE
LINKED LIST REPRESENTATION A B C D E H F G THE NODE D,E,F,G AND H CONTAIN A NULL  VALUE IN BOTH THEIR LINK FIELD AS THESE  ARE THE LEAF
ARRAY REPRESENTATION  OF BINARY TREE WHEN A BINARY TREE IS REPRESENTATED BY ARRAY THREE SEPRATE ARRAY  IS REQUIRED ONE ARRAY ARR STORE DATA FEIDS OF THE TREE THE OTHER TWO ARRAY ARE  LC AND RC I.E...... LEFT  AND  RIGHTCHILD
ARRAY REPRESENTATION AR A B C D E F LC 1 2 3 4 5 6 RC 2 6 8 4 9 7 ARRAY
PPT PRESENTATION ONSTACK DATA STRUCTURE BCA  2nd  semester Dept. of computer science Presented by:-  Guided by:- RICHA MITTAL   HARISH SIR RANI KUSHWAH
CONCEPT OF STACK
Topic Covered ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
A Stack is a linear collection of data in which new item may be inserted and  deleted at one end. It sometimes called LIFO and push down list . A stack is usually represented by computer by block of memory cells. Thus, stack data structure implemented (LIFO) property. The situation of LIFO may be compared as the plates of cafeteria where every new plate will added at the top.  INTRODUCTION TO STACK
[object Object],[object Object],[object Object],[object Object]
23 41 25 36 12 Push Operation on  stack  ( PUSH ) INSERT 41 TO STACK ( PUSH ) INSERT 23 TO STACK ( PUSH ) INSERT 25 TO STACK ( PUSH ) INSERT 36 TO STACK ( PUSH ) INSERT 12 TO STACK STACK
23 41 25 36 12 POP OPERATION ON STACK ( POP ) DELETE 12 FROM THE STACK ( POP ) DELETE 36 FROM THE STACK ( POP ) DELETE 25 FROM THE STACK ( POP ) DELETE 23 FROM THE STACK ( POP ) DELETE 41 FROM THE STACK STACK
EXPRESSION :-   A  +  B  *  C C * B + A scan CONVERSION OF INFIX TO PREFIX NOTATION STACK INFIX PREFIX Character  (C) scanned Operator(*) scanned Push (*) into the stack Character (B) scanned Priority of(*)is higher than (+),so(*) operator is poped from the stack Character(A) Scanned Pop(+) from the stack
CONVERSION OF INFIX TO POSTFIX NOTATION EXPRESSION :-   A  +  B  *  C STACK A + B * C INFIX SCAN POSTFIX Character(A) scanned Operator(+) scanned Character (B) scanned Operator (*) scanned Character (c) Scanned Priority of (*) is high, pop(*) from the stack  pop (+) from the stack
CONVERSION OF PREFIX TO POSTFIX NOTATION EXPRESSION :-  +  A  *  B  C C B * A + scan PREFIX POSTFIX STACK OPERATOR (+)SCANNED CHARACTER (A) SCANNED OPERATOR (*)SCANNED CHARACTER(B) SCANNED CHARACTER (C)SCANNED Priority of (*) is higher than (+) ,pop (*) from the stack Pop (+) from the stack
CONVERSION OF POSTFIX TO INFIX NOTATION EXPRESSION :-  A  B + C  * SCAN A B + C * Operator(*) scanned, push to the stack Character (C)  scanned Operator(+) scanned Priority of (*) is higher than (+),so (*) is pop from the stack Push (+) to the stack Scanned character (B) Pop (+) from the stack Character (A) scanned POSTFIX STACK INFIX
THANK YOU
INTRODUCTION OF QUEUE
[object Object],[object Object]
  CONCEPT ,[object Object],[object Object],[object Object]
QUEUE AS A SINGLE   LINE
QUEUE ON GAME    STATION
OPERATIONS OF QUEUE ,[object Object],[object Object]
FIRST OPERATIONS OF Q ,[object Object],B C Front Rear A
[object Object],A B C Front Rear D
SECOND OPERATION OF Q   ,[object Object],D A B C Front Rear
GRAPHS IN DATA  STRUCTURE GUIDED BY-HARISH SIR PRESENTED BY-PUJA SONI
GRAPHS IE….. SPREAD YOUR TENTACLES
I N COMPUTER SCIENCE,GRAPH IS USE TO CREATE  ROAD STRUCTURE MAPS AEROPLANE MAPS ETC...
N ETWORKING! BE IT ANY WALK OF LIFE THAT’S THE KEY WORD TODAY BETTER YOUR NETWORK,FARTHER YOU WOULD REACH AND FUTHER YOU REPLACE YOUR TENTACLES BETTER WOULD YOU NETWORK, AND THE CRUX OF BUILDING AND MANAGING A NETWORK IS HIDDEN IN A SUBJECT AS INNOCUOUS AS DATA STRUCTURE IN A TOPIC CALLED GRAPHS
TERMINOLOGY THE NATURAL WAY TO UNDERSTAND  A  GRAPH IS TO REPRESENT VERTICES AS POINT OR CIRCLES AND EDGES AS LINE SEGEMENT OR ARCS CONNECTING THE VERTICES
GRAPHS ,[object Object],[object Object]
APPLICATION OF GRAPHS NOW A DAYS MANY APPLICATION RELATED WITH COMPUTATION RELATED WITH COMPUTATION CAN BE MANAGED EFFICIENTLY WITH GRAPH DATA STRUCTURE computer network Vertices in the graph might represent computer instollation, edges represent connection between computers.where we want to allow message from any computer to get any other possibility with routing through intermidiate computer with minimum cost of connection air lines routes vertices in a graph are cities and edges are root between cities we want to service a connected set of cities with minimum cost
TYPES OF GRAPHS ,[object Object],[object Object],IN THIS TYPE OF GRAPH PATH IS SPECIFIED THAT TYPE OF GRAPH IS CALLED  DIRECTED GRAPH IN THIS TYPE OF GRAPH PATH IS NOT SPECIFIED IN THIS TYPE OF GRAPH THIS TYPE OF GRAPH IS CALLED  UNDIRECTED GRAPH
selected south pacific air route this is also a graph THERE ARE MANY KINDS OF GRAPH
THE VARIOUS KIND OF UNDIRECTED GRAPH CONNECTED PATH THERE ARE SEVERAL UNDIRECTED GRAPH.TWO VERTICES IN AN UNDIRECTED GRAPH IS CALLED ADJACENT IF THERE IS AN EDGE OFROM FRIST TO THE SECOND ADJACENT
DIRECTED GRAPH THIS IS DIRECTED GRAPH  BECAUSE PATH IS SPECIFIED IN THIS GRAPH
CONNECTED DISCONNECTED PATH CYCLE TREE THESE ARE  THE VARIOUS KIND OF UNDIRECTED GRAPH
THANK YOU
Presented by Shivani & Palvinder
Link list as data structure
LINK LIST Definition:  In computer science linked list is a data structure that consist of a sequence of data record such that in each record there is a field that contains a reference of next record in a sequence
[object Object]
A linked list consists of several nodes. Each node consists of a data part and a link part.   Node Data Link
Use of Linked List ,[object Object],[object Object],[object Object],[object Object]
Advantage of link list ,[object Object],[object Object],[object Object],[object Object]
Disadvantage of link list ,[object Object],[object Object]
Building a linked list Node Data Link 70 NULL 100 80 NULL 200 90 NULL 300 300 200
10 20 30 100 200 300 NULL This is linked list of 3 nodes Allocate memory for a new node 700 Set 99 value in data part of new node 99 Set link part of a new node ,with the address of first node  Adding a new node at the beginning
DELETION OF A NODE IN A LINK LIST 45 56 80 75 200 300 400 500 Initially link contain four nodes. Set links to the node. Delete third node from the list null Set value to the nodes FREE THE MEMORY OCCUPIED BY THIRD NODE
Types of link list ,[object Object],[object Object],[object Object],[object Object],[object Object]
Singly link list ,[object Object]
SINGLY LINK LIST START A . . X INFO PART ADDRESS PART B C
Doubly link list ,[object Object],[object Object],[object Object],[object Object]
DOUBLY LINK LIST BACK INFO NEXT
START . A . . B . . C X
Circular link list ,[object Object]
CIRCULAR LINK LIST START A B C . . .
DOUBLY CIRCULAR LINK LIST  ,[object Object]
DOUBLY CIRCULAR LINK LIST START . A . . . . C . B

Weitere ähnliche Inhalte

Was ist angesagt? (20)

Lecture8 data structure(graph)
Lecture8 data structure(graph)Lecture8 data structure(graph)
Lecture8 data structure(graph)
 
Binary Search Tree
Binary Search TreeBinary Search Tree
Binary Search Tree
 
Linked list
Linked listLinked list
Linked list
 
Tree - Data Structure
Tree - Data StructureTree - Data Structure
Tree - Data Structure
 
Linked list
Linked listLinked list
Linked list
 
Queues in C++
Queues in C++Queues in C++
Queues in C++
 
Circular link list.ppt
Circular link list.pptCircular link list.ppt
Circular link list.ppt
 
stack presentation
stack presentationstack presentation
stack presentation
 
Data Structures (CS8391)
Data Structures (CS8391)Data Structures (CS8391)
Data Structures (CS8391)
 
Trees, Binary Search Tree, AVL Tree in Data Structures
Trees, Binary Search Tree, AVL Tree in Data Structures Trees, Binary Search Tree, AVL Tree in Data Structures
Trees, Binary Search Tree, AVL Tree in Data Structures
 
Introduction to data structure ppt
Introduction to data structure pptIntroduction to data structure ppt
Introduction to data structure ppt
 
Linked List
Linked ListLinked List
Linked List
 
Terminology of tree
Terminology of treeTerminology of tree
Terminology of tree
 
BINARY TREE REPRESENTATION.ppt
BINARY TREE REPRESENTATION.pptBINARY TREE REPRESENTATION.ppt
BINARY TREE REPRESENTATION.ppt
 
Doubly Linked List
Doubly Linked ListDoubly Linked List
Doubly Linked List
 
queue & its applications
queue & its applicationsqueue & its applications
queue & its applications
 
Binary Tree Traversal
Binary Tree TraversalBinary Tree Traversal
Binary Tree Traversal
 
Binary Search Tree in Data Structure
Binary Search Tree in Data StructureBinary Search Tree in Data Structure
Binary Search Tree in Data Structure
 
linked list in Data Structure, Simple and Easy Tutorial
linked list in Data Structure, Simple and Easy Tutoriallinked list in Data Structure, Simple and Easy Tutorial
linked list in Data Structure, Simple and Easy Tutorial
 
Threaded Binary Tree
Threaded Binary TreeThreaded Binary Tree
Threaded Binary Tree
 

Ähnlich wie DATA STRUCTURES

Ähnlich wie DATA STRUCTURES (20)

Unit8 C
Unit8 CUnit8 C
Unit8 C
 
Data Structures
Data StructuresData Structures
Data Structures
 
Trees unit 3
Trees unit 3Trees unit 3
Trees unit 3
 
Linked Lists Saloni
Linked Lists SaloniLinked Lists Saloni
Linked Lists Saloni
 
stacks and queues
stacks and queuesstacks and queues
stacks and queues
 
My File Structure Btrees Project Report
My File Structure Btrees Project ReportMy File Structure Btrees Project Report
My File Structure Btrees Project Report
 
Trees
TreesTrees
Trees
 
Index management in depth
Index management in depthIndex management in depth
Index management in depth
 
Stacks and Queue - Data Structures
Stacks and Queue - Data StructuresStacks and Queue - Data Structures
Stacks and Queue - Data Structures
 
Design and Analysis of Algorithms
Design and Analysis of AlgorithmsDesign and Analysis of Algorithms
Design and Analysis of Algorithms
 
lect- 3&4.ppt
lect- 3&4.pptlect- 3&4.ppt
lect- 3&4.ppt
 
Data structure and algorithm.(dsa)
Data structure and algorithm.(dsa)Data structure and algorithm.(dsa)
Data structure and algorithm.(dsa)
 
(Binary tree)
(Binary tree)(Binary tree)
(Binary tree)
 
Lect 22 Zaheer Abbas
Lect 22 Zaheer AbbasLect 22 Zaheer Abbas
Lect 22 Zaheer Abbas
 
L3
L3L3
L3
 
Stack and queue
Stack and queueStack and queue
Stack and queue
 
Stacks & Queues By Ms. Niti Arora
Stacks & Queues By Ms. Niti AroraStacks & Queues By Ms. Niti Arora
Stacks & Queues By Ms. Niti Arora
 
Stacks & Queues
Stacks & QueuesStacks & Queues
Stacks & Queues
 
Stack & Queue using Linked List in Data Structure
Stack & Queue using Linked List in Data StructureStack & Queue using Linked List in Data Structure
Stack & Queue using Linked List in Data Structure
 
Data structures
Data structuresData structures
Data structures
 

Kürzlich hochgeladen

Boys Wholesale Clothing Online | Port 213
Boys Wholesale Clothing Online | Port 213Boys Wholesale Clothing Online | Port 213
Boys Wholesale Clothing Online | Port 213Port 213
 
HVAC Replacement Process for Commercial Buildings Guide
HVAC Replacement Process for Commercial Buildings GuideHVAC Replacement Process for Commercial Buildings Guide
HVAC Replacement Process for Commercial Buildings Guideoutreachacdirect
 
Alex Gurkin: Strategies for a Sustainable Tech Career
Alex Gurkin: Strategies for a Sustainable Tech CareerAlex Gurkin: Strategies for a Sustainable Tech Career
Alex Gurkin: Strategies for a Sustainable Tech CareerAlex Gurkin
 
Bridging Cultures: Antique Indian Doors with Mediterranean Arches
Bridging Cultures: Antique Indian Doors with Mediterranean ArchesBridging Cultures: Antique Indian Doors with Mediterranean Arches
Bridging Cultures: Antique Indian Doors with Mediterranean ArchesEra Chandok
 
Secrets for A Happy Relationship & Marriage.
Secrets for A Happy Relationship & Marriage.Secrets for A Happy Relationship & Marriage.
Secrets for A Happy Relationship & Marriage.Surajkurrey
 
The Heirloom Gown: A Tale of Love and Legacy
The Heirloom Gown: A Tale of Love and LegacyThe Heirloom Gown: A Tale of Love and Legacy
The Heirloom Gown: A Tale of Love and Legacyirumsohale
 
Oι πιο ευτυχισμένες και οι πιο δυστυχισμένες χώρες: Πρωτιά για τη Φινλανδία -...
Oι πιο ευτυχισμένες και οι πιο δυστυχισμένες χώρες: Πρωτιά για τη Φινλανδία -...Oι πιο ευτυχισμένες και οι πιο δυστυχισμένες χώρες: Πρωτιά για τη Φινλανδία -...
Oι πιο ευτυχισμένες και οι πιο δυστυχισμένες χώρες: Πρωτιά για τη Φινλανδία -...Newsroom8
 
Beyond Academics - Anibal Romero .pdf
Beyond Academics - Anibal Romero    .pdfBeyond Academics - Anibal Romero    .pdf
Beyond Academics - Anibal Romero .pdfroberttianibal
 

Kürzlich hochgeladen (8)

Boys Wholesale Clothing Online | Port 213
Boys Wholesale Clothing Online | Port 213Boys Wholesale Clothing Online | Port 213
Boys Wholesale Clothing Online | Port 213
 
HVAC Replacement Process for Commercial Buildings Guide
HVAC Replacement Process for Commercial Buildings GuideHVAC Replacement Process for Commercial Buildings Guide
HVAC Replacement Process for Commercial Buildings Guide
 
Alex Gurkin: Strategies for a Sustainable Tech Career
Alex Gurkin: Strategies for a Sustainable Tech CareerAlex Gurkin: Strategies for a Sustainable Tech Career
Alex Gurkin: Strategies for a Sustainable Tech Career
 
Bridging Cultures: Antique Indian Doors with Mediterranean Arches
Bridging Cultures: Antique Indian Doors with Mediterranean ArchesBridging Cultures: Antique Indian Doors with Mediterranean Arches
Bridging Cultures: Antique Indian Doors with Mediterranean Arches
 
Secrets for A Happy Relationship & Marriage.
Secrets for A Happy Relationship & Marriage.Secrets for A Happy Relationship & Marriage.
Secrets for A Happy Relationship & Marriage.
 
The Heirloom Gown: A Tale of Love and Legacy
The Heirloom Gown: A Tale of Love and LegacyThe Heirloom Gown: A Tale of Love and Legacy
The Heirloom Gown: A Tale of Love and Legacy
 
Oι πιο ευτυχισμένες και οι πιο δυστυχισμένες χώρες: Πρωτιά για τη Φινλανδία -...
Oι πιο ευτυχισμένες και οι πιο δυστυχισμένες χώρες: Πρωτιά για τη Φινλανδία -...Oι πιο ευτυχισμένες και οι πιο δυστυχισμένες χώρες: Πρωτιά για τη Φινλανδία -...
Oι πιο ευτυχισμένες και οι πιο δυστυχισμένες χώρες: Πρωτιά για τη Φινλανδία -...
 
Beyond Academics - Anibal Romero .pdf
Beyond Academics - Anibal Romero    .pdfBeyond Academics - Anibal Romero    .pdf
Beyond Academics - Anibal Romero .pdf
 

DATA STRUCTURES

  • 1. DREAM VALLEY COLLEGE FOR GIRLS CENTRE FOR EDUCATIONAL EXECELLENCE ADD:-Near Railway spring factory, Sitholi , Gwalior (MP) AFFILATED TO:- JIWAJI UNIVERSITY (strictly according to jiwaji university)
  • 2. PPT PRESENTATION On DATA STRUCTURE BCA 2nd semester PRESENTED BY GUIDED BY HARISH SIR
  • 3. INDEX ARRAY LINKED LIST QUEUES TREES GRAPHS SEARCH IT OUT STACK ARRAY STACK LINKEDLIST QUEUES TREES GRAPHS -
  • 4.
  • 5. A B C F E D Array representation on memory OR INSERTION OF ELEMENT IN THE ARRAY
  • 6.
  • 7. A B C D E F DELETION OF ELEMENT IN THE ARRAY Delete (F) from the array. Delete (E) from the array. Delete (D) from the array. Delete (C) from the array. Delete (B) from the array. Delete (A) from the array.
  • 8. TREES IN DATA STRUCTURE DREAM VALLEY GROUP OF COLLEGE ADD-NEAR RAILWAY SPRING FACTORY QUARTERS PHONE-2469990
  • 9. TREES IN DATA STRUCTURE PRESENTED BY- GUIDED BY- HARISH SIR PUJA AND SHAIFALI
  • 10. TOPIC COVERED WHAT IS TREE ROLE OF TREE IN DATA STRUCTURE BUILDING A SIMPLE TREE TYPES OF TREES BUILDING A BINARY TREE INORDER PRE ORDER POST ORDER ARRAY LINKED LIST
  • 11. WHAT IS TREE TREES BRANCHES LEAVES ETC
  • 12. NATURE IS A MAN'S BEST TEACHER IF YOU UNDRESTAND THE CONCEPT OF TREE IT MEANS SIMPLE TREE --> CHILD NODE <- ROOT NODE/PARENT NODE
  • 13. BUT IN DATASTRUCTURE TREE IS CREATED LIKE THIS BUT IN REVERSE FORM --> TREES IN REVERSE FORM -> child node <- root node
  • 14. IN A TREE STRUCTURE,HOWEVER EACH NODE MAY POINT TO SEVERAL NODE.
  • 15. Binary tree->binary tree is defined as finite set of node in which number of the children of a node should not exceed more than two .it means the degree of binary tree not then greater then two .
  • 16. BINARY TREE A B C D E F G THIS IS A BINARY TREE ROOT NODE CHILD NODE BRANCHES
  • 17. TYPES OF BINARY TREE STRICTLY BINARY TREE COMPLETE BINARY TREE EXTENDED BINARY TREE
  • 18. In every non terminal node in a binary tree consists of non empty left subtree and right subtree ,then such a tree is called strictly binary tree . STRICTLY BINARY TREE
  • 19. STRICTLY BINARY TREE A B D E C F G NON TERMINAL NON TERMINAL
  • 20. Complete binary tree The level of all nodes of complete binary tree is equal .
  • 21. A B C D E F G complete binary tree 0 1 2 THESE ARE LEVEL OF COMPLETE BINARY TREE AND THE LEVEL OF THIS COMPLTE BINARY TREE IS 2
  • 22. building a binary tree element are to be added 20 7 26 8 18 6 28 20 20 is a root node of this tree > 7 7 is compared with 20 7 > 26 26 is compared with 20 26 7 AND 26 IS CHILD NODE OF THE ROOT TREE > 8 8 IS COMPARED TO 26 THEN COMPARED TO 7 > 8 8 > 6 6 IS COMPARED WITH 20 AND 7 > 6 6 < 18 < 18 18 18 IS COMPARED WITH 20 AND 26 > 28 > 28 28 IS COMPARED WITH 20 AND 26 28 THIS IS THE BUILDING OF BINARY TREE THEN.. TRAVERSAL OF A BINARY TREE
  • 23.
  • 24.
  • 25.
  • 26. Representation of a binary trees in memory ->there are two ways by which we can represent a binary tree LINKED LIST ARRAY ARRAY LINKED LIST
  • 27. BINARY TREE CAN BE REPRESENTED BY LINKS WHERE EACH NODE CONTAINS THE ADDRESS OF THE LEFT CHILD AND THE RIGHT CHILD
  • 28. LINKED LIST REPRESENTATION LEFT DATA RIGHT NODE
  • 29. LINKED LIST REPRESENTATION A B C D E H F G THE NODE D,E,F,G AND H CONTAIN A NULL VALUE IN BOTH THEIR LINK FIELD AS THESE ARE THE LEAF
  • 30. ARRAY REPRESENTATION OF BINARY TREE WHEN A BINARY TREE IS REPRESENTATED BY ARRAY THREE SEPRATE ARRAY IS REQUIRED ONE ARRAY ARR STORE DATA FEIDS OF THE TREE THE OTHER TWO ARRAY ARE LC AND RC I.E...... LEFT AND RIGHTCHILD
  • 31. ARRAY REPRESENTATION AR A B C D E F LC 1 2 3 4 5 6 RC 2 6 8 4 9 7 ARRAY
  • 32. PPT PRESENTATION ONSTACK DATA STRUCTURE BCA 2nd semester Dept. of computer science Presented by:- Guided by:- RICHA MITTAL HARISH SIR RANI KUSHWAH
  • 34.
  • 35. A Stack is a linear collection of data in which new item may be inserted and deleted at one end. It sometimes called LIFO and push down list . A stack is usually represented by computer by block of memory cells. Thus, stack data structure implemented (LIFO) property. The situation of LIFO may be compared as the plates of cafeteria where every new plate will added at the top. INTRODUCTION TO STACK
  • 36.
  • 37. 23 41 25 36 12 Push Operation on stack ( PUSH ) INSERT 41 TO STACK ( PUSH ) INSERT 23 TO STACK ( PUSH ) INSERT 25 TO STACK ( PUSH ) INSERT 36 TO STACK ( PUSH ) INSERT 12 TO STACK STACK
  • 38. 23 41 25 36 12 POP OPERATION ON STACK ( POP ) DELETE 12 FROM THE STACK ( POP ) DELETE 36 FROM THE STACK ( POP ) DELETE 25 FROM THE STACK ( POP ) DELETE 23 FROM THE STACK ( POP ) DELETE 41 FROM THE STACK STACK
  • 39. EXPRESSION :- A + B * C C * B + A scan CONVERSION OF INFIX TO PREFIX NOTATION STACK INFIX PREFIX Character (C) scanned Operator(*) scanned Push (*) into the stack Character (B) scanned Priority of(*)is higher than (+),so(*) operator is poped from the stack Character(A) Scanned Pop(+) from the stack
  • 40. CONVERSION OF INFIX TO POSTFIX NOTATION EXPRESSION :- A + B * C STACK A + B * C INFIX SCAN POSTFIX Character(A) scanned Operator(+) scanned Character (B) scanned Operator (*) scanned Character (c) Scanned Priority of (*) is high, pop(*) from the stack pop (+) from the stack
  • 41. CONVERSION OF PREFIX TO POSTFIX NOTATION EXPRESSION :- + A * B C C B * A + scan PREFIX POSTFIX STACK OPERATOR (+)SCANNED CHARACTER (A) SCANNED OPERATOR (*)SCANNED CHARACTER(B) SCANNED CHARACTER (C)SCANNED Priority of (*) is higher than (+) ,pop (*) from the stack Pop (+) from the stack
  • 42. CONVERSION OF POSTFIX TO INFIX NOTATION EXPRESSION :- A B + C * SCAN A B + C * Operator(*) scanned, push to the stack Character (C) scanned Operator(+) scanned Priority of (*) is higher than (+),so (*) is pop from the stack Push (+) to the stack Scanned character (B) Pop (+) from the stack Character (A) scanned POSTFIX STACK INFIX
  • 45.
  • 46.
  • 47. QUEUE AS A SINGLE LINE
  • 48. QUEUE ON GAME STATION
  • 49.
  • 50.
  • 51.
  • 52.
  • 53. GRAPHS IN DATA STRUCTURE GUIDED BY-HARISH SIR PRESENTED BY-PUJA SONI
  • 54. GRAPHS IE….. SPREAD YOUR TENTACLES
  • 55. I N COMPUTER SCIENCE,GRAPH IS USE TO CREATE ROAD STRUCTURE MAPS AEROPLANE MAPS ETC...
  • 56. N ETWORKING! BE IT ANY WALK OF LIFE THAT’S THE KEY WORD TODAY BETTER YOUR NETWORK,FARTHER YOU WOULD REACH AND FUTHER YOU REPLACE YOUR TENTACLES BETTER WOULD YOU NETWORK, AND THE CRUX OF BUILDING AND MANAGING A NETWORK IS HIDDEN IN A SUBJECT AS INNOCUOUS AS DATA STRUCTURE IN A TOPIC CALLED GRAPHS
  • 57. TERMINOLOGY THE NATURAL WAY TO UNDERSTAND A GRAPH IS TO REPRESENT VERTICES AS POINT OR CIRCLES AND EDGES AS LINE SEGEMENT OR ARCS CONNECTING THE VERTICES
  • 58.
  • 59. APPLICATION OF GRAPHS NOW A DAYS MANY APPLICATION RELATED WITH COMPUTATION RELATED WITH COMPUTATION CAN BE MANAGED EFFICIENTLY WITH GRAPH DATA STRUCTURE computer network Vertices in the graph might represent computer instollation, edges represent connection between computers.where we want to allow message from any computer to get any other possibility with routing through intermidiate computer with minimum cost of connection air lines routes vertices in a graph are cities and edges are root between cities we want to service a connected set of cities with minimum cost
  • 60.
  • 61. selected south pacific air route this is also a graph THERE ARE MANY KINDS OF GRAPH
  • 62. THE VARIOUS KIND OF UNDIRECTED GRAPH CONNECTED PATH THERE ARE SEVERAL UNDIRECTED GRAPH.TWO VERTICES IN AN UNDIRECTED GRAPH IS CALLED ADJACENT IF THERE IS AN EDGE OFROM FRIST TO THE SECOND ADJACENT
  • 63. DIRECTED GRAPH THIS IS DIRECTED GRAPH BECAUSE PATH IS SPECIFIED IN THIS GRAPH
  • 64. CONNECTED DISCONNECTED PATH CYCLE TREE THESE ARE THE VARIOUS KIND OF UNDIRECTED GRAPH
  • 66. Presented by Shivani & Palvinder
  • 67. Link list as data structure
  • 68. LINK LIST Definition: In computer science linked list is a data structure that consist of a sequence of data record such that in each record there is a field that contains a reference of next record in a sequence
  • 69.
  • 70. A linked list consists of several nodes. Each node consists of a data part and a link part. Node Data Link
  • 71.
  • 72.
  • 73.
  • 74. Building a linked list Node Data Link 70 NULL 100 80 NULL 200 90 NULL 300 300 200
  • 75. 10 20 30 100 200 300 NULL This is linked list of 3 nodes Allocate memory for a new node 700 Set 99 value in data part of new node 99 Set link part of a new node ,with the address of first node Adding a new node at the beginning
  • 76. DELETION OF A NODE IN A LINK LIST 45 56 80 75 200 300 400 500 Initially link contain four nodes. Set links to the node. Delete third node from the list null Set value to the nodes FREE THE MEMORY OCCUPIED BY THIRD NODE
  • 77.
  • 78.
  • 79. SINGLY LINK LIST START A . . X INFO PART ADDRESS PART B C
  • 80.
  • 81. DOUBLY LINK LIST BACK INFO NEXT
  • 82. START . A . . B . . C X
  • 83.
  • 84. CIRCULAR LINK LIST START A B C . . .
  • 85.
  • 86. DOUBLY CIRCULAR LINK LIST START . A . . . . C . B