In making a program, a language needs to be done
programming. Many kinds of things
high level programming languages provide enough choice for programmers
to choose the program language like what the programmer matches. Para
New programmers can also learn about functions
programming language for learning programming.
One part that needs to be considered in making a program
is the existence of a data structure. For some programmers, the data structure is already
familiar. But for beginners, the data structure is still not so
understood. Therefore, before knowing what types of data structures are in
programming, it's good to first understand what the following data structure is
Definition of data structure
Data structure in computer terms is a method for
storing, compiling, and managing various data that is inside a
storage on a computer. These data can be various kinds, some are
in the form of symbols, numbers, letters, etc.
Type of data structure
Well, if you already understand
understanding of data structures, next we see what types
the data structure.
The first type is Type
Array. This type is a group of various elements whose distance
close together in each memory. In the Array elements section has
several indexes to place elements in an array. Data that
use on arrays must be uniform.
Cobtoh examples of operations
used on Arrays including delete, insert, replace, and various operations
others. Arrays also have two types of dimensions, namely one dimension and
2. Linked list
Next is the part
linked list. As the name implies, the linked list is the list that will
connected to each other. Basically a linked list is a
stormy pieces of data stored randomly. Pieces
the data is in a computer's memory, however, the data
have references to be shown from data one to various other data.
In a linked list, data
first made often referred to as head. While the last data
will be referred to as tail. Based on the amount of data entered, the linked list
able to connect with single or double. In single section, direction
access is sequential in the future. Starting from the head to the section
tail. Whereas in the double section, the direction of access can be made back and forth. That means
can be from head to tail or vice versa.
3. Type Stack
Stack type is type
third data structure. In this type, the data structure used is
linear. The linear data structure basically has LIFO properties. LIFO
is an abbreviation of Last In First Out.
This type of Stack also has
three types of operations that can be shown. The three operations include Pop
or delete the topmost data in a Stack, Push or enter
a new data to the Stack section, and finally Peek or monitor
most data above from Stack.
4. Type Queue
The next type is
Queue. Maybe you have heard or once glimpsed about
This Queue. basically the Queue type is not much different from Stack. Even,
in some parts, Queue bears a resemblance to Stack. It's just, Type
Queue has LIFO properties. Basically the operating system is in this Queue type
has three types. First is Dequeue or delete some part data
first in Queue, Enqueue or the process of entering data in the Queue section, and
last is Peek or monitoring data in the first part of Queue.
5. Type Tree
As the name implies, type
This one data structure is like a root in a tree. Basically,
This Tree type has a collection of several nodes. Each node is arranged
from various values and other references. The Tree section has a Binary term
Tree. Binary Tree itself is a Tree Type with two references. Binary Tree
It has two sub-trees, namely on the left and right. Left side
has a small root value, while on the right, the root value
greater than. There are three types of ways to access various data within a
Tree. First preorder, inorder, and postorder.
6. Graph Type
The last type is Graph. Graph type is a data structure that is associated with various specific lines. The line has two kinds. some have directions and some have no direction. Well, this type of graph is often used in everyday life.
Hopefully this article can provide benefits to you and all of us.