Tuesday, 12 November 2013

Data Structures Lab programs update



1. Program to represent a graph using Adjacency matrix for the given set of vertices and edges and traverse it by using BREADTH FIRST SEARCH 



2. Program to represent a graph using Adjacency matrix for the given set of vertices and edges and traverse it by using DEPTH FIRST SEARCH  


The output for both the programs is the below example, follow the image for reference:










Thursday, 7 November 2013

Data Structures Lab programs UPDATE

BINARY TREES


1. Creation of binary search tree (BST) and performing - Insertion, Deletion and Searching operations on it. 

2. Binary tree traversals- Inorder, Preorder and Postorder