ABOUT BLOG & AUTHORS

######…DATASTRUCTURES…###### ………The Team Work of Bhanu,Swarna & Karthik       Hi we are Studying 4th B.tech C.S.E. in Sri Venkateswara University College of Engineering,Tirupati.This Blog is about the Datastructures.The C++ Programming Code is GIven.It is under DevelopmentSoon We Will Finish and Improve Further. Please Visit and Comment on it(This blog will appear in google search just [...]

INTRODUCTION

HOME Datastructures: Data structures involve the organizing the data in different methods and performing the operations on these structures. Datastructures are categorized as shown in fig: Primitive Datastructures: These are the datastructures which are directly supported by the machine.i.e.Any operation can be performed in these data items. Eg:Integers,Real numbers,datatype involving characters and some logical statements. [...]

LINKED LIST

HOME Linked list: In order to store elements in the sequential fashion we use Arrays. But they are fixed max size,suppose if we want to use less memory than that of fixed size then memory is wastaged, or If we want to use more memory than that of fixed size then deficiency of the memory [...]

STACKS

HOME Stacks: Stack is nothing but a list of elements where insertion and deletion are possible at one end i.e. stack top. It follows Last In First Out [LIFO] property. Stacks are represented using Arrays and Linked lists. HOME

QUEUES

HOME Queues: Queue is also a list of elements with insertion is permitted at one end called rear end and deletion permitted at another end called front end. It follows the property of First In First Out [FIFO]. Queues also implemented using Arrays and Linked lists. HOME

TREES

HOME Definition of a Tree: A tree is a set of one or more nodes T such that: (i).There is a specially designated node called a root (ii).The remaining nodes are partitioned into n disjointed set of nodes T1, T2,…,Tn, each of which is a tree. Degree of a Node of a Tree: The degree [...]