Home > Uncategorized > Data Structures

Data Structures

Introduction
Self-Referential Structures
Dynamic Memory Allocation
Linked Lists
Stacks
Queues
Trees

Introduction

Dynamic data structures

–Data structures that grow and shrink during execution

•Linked lists

–Allow insertions and removals anywhere

•Stacks

–Allow insertions and removals only at top of stack

•Queues

–Allow insertions at the back and removals from the front

•Binary trees

–High-speed searching and sorting of data and efficient elimination of duplicate data items

Categories: Uncategorized
  1. No comments yet.
  1. No trackbacks yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: