ARRAY

Array is a bunch of similar data that is stored into the variable with the same name, by giving the index in the variable to distinguish from each other.

ARRAY VARIABLES

nama_variabel [index]

provision arrray variable name the same as regular variable names.

index indicates the number of variables.

ARRAY VARIABLE DECLARATION

BU,: type nama_variabel [index];

Example: float bil [10];

STACK

Stack or the heap is a collection of objects that use the principle of LIFO (Last In First Out), ie the data entered will terakhr first out of the stack. Stack is implemented as a representation can be hooked or kontigu (with table fix).
Stack Feature:

* Element TOP (top) unknown
* Penisipan and removal of elements is always done at TOP
* LIFO

Use of Stack:
* Calculation of arithmetic expressions (Postfix)
* Backtraking algorithm (trace back)
* Recursive algorithm

Queue

FIFO queue
queue is a type of container adapter, specifically designed to operate within the context of the FIFO (first-in first-out), where the elements inserted into one end of the container and is extracted from the other.

TREE

Definition TREE
• It is a form of non-linear data structure
• A collection of elements one of which is called Roots and other residual elements called nodes

actually what is the use of this tree data structure?
utility tree are:

LINK LIST

Linked list is one of the basic data structure, and can be used untukmenerapkan other data structures. In a linked list contained different numbers of node.Setiap node consists of two fields. First field contains the value or data and kolomkedua holds a reference to next node, or null if the linked list is empty.:

usually in the to declare a node,mostly use the class. For example:

class Node{

private :

……

Node* berikut;

};

The following node is a pointer to an address in memory;

but here may be to use struct

A key part of the linked list is a structure, which holds data for setiapnode (name, address, age or anything else for that item in the list), and most importantly, a pointer to the next node. Here I have given typical node structure:

Binary Heap dan Priority Queue

Back to the hierarchical data structure, there is a binary tree structure called a binary heap. A binary heap is a binary tree in which stored data by a certain sort: in a binary heap with the principle of “minheap” data on each parent in the tree should not be larger than the data on children. Thus the root of the tree contain the smallest number of all numbers in the tree. In a binary heap with the principle of “maxheap”, the parent should not be smaller than their children so that the root contains the largest number of all numbers in the tree.

TEMPLATE

Templates

Overloading of functions is not something that seems familiar to us. By using the overloading of functions can be created several functions that handle a process with different data types, but use the same name, for example:
void exchange (int & x, int & y)
{
int temp;

tmp = x;
x = y;
y = temp;
}

void exchange (double & x, double & y)
{
double tmp;

tmp = x;
x = y;
y = tmp;
}

B+Tree

Still in the hierarchical data structure, lecture day discusses B + Tree. This data structure is a variant of the original data structures (a, b)-Tree, but in its development of this structure are used specifically as an external data structures (ie, file the indexed) and later in a relational DBMS to organize the index key of the database table.

Practicum Ninth Data Structure

#include <cstdlib>

#include <iostream>
#define maks 5
using namespace std;
class queue{
friend ostream& operator <<(ostream&, const queue&);

public :
queue();
int penuh(int);
int kosong(int);
void cetak ();
void enqueue(char);
char dequeue();
private:
char A[maks];
int banyak;

};

Linear Linked List

Data structure known as the “linked list” it is a structure that is linear, but dynamic.

Each data item is placed in a cell (or element,) and one cell is connected to the next cell using a pointer to form a single series of cells ranging from head (element head) to taels (element last) like the series of train carriages.