Data Structures

Today, we learnt about different data structures, and their applications in Computer Science. It was interesting to see how they served very specific purposes at times, and examples like the “undo” (Ctrl+Z) command using the Stack Data Structure made things simpler to understand.

We first learnt about the Array data structure, also known as a one dimensional array. They can be used in various algorithms to decrease run time, and increase efficiency.

Array1

The next data structure we went over was queue. It follows the process of first in, first out (FIFO). It is an example of a linear data structure.

Queue1

In the Stack data structure, the last element added to the structure must be the first one to be removed, and hence it works on the principle of Last in, First out (LIFO).

Stack1

Binary Trees are used for efficient searching and sorting. It consists of The root node, parents, children. One parent node can have a maximum of two children.

BinaryTree1

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 )

Connecting to %s