Double Linked List

?html>
?head>
?title>Struktur Data Double Linked List?/title>
?/head>

?body>
?script language = "JavaScript">
?!--
function DoublyLinkedList()
{
this._Kepala = null;
this._Ekor = null;
this._Panjang = 0;
}

DoublyLinkedList.prototype =
{
constructor: DoublyLinkedList,
Tambah: function (data)
{
var node = {data: data, next: null, prev: null};

if (this._Panjang == 0)
{
this._Kepala = node;
this._Ekor = node;
}
else
{
this._Ekor.next = node;
node.prev = this._Ekor;
this._Ekor = node;
}
this._Panjang++;

},

ItemList: function(index)
{
if (index > -1 && index ? this._Panjang)
{
var NodeTanda = this._Kepala,
i = 0;

while(i++ ? index)
{
NodeTanda = NodeTanda.next;
}

return NodeTanda.data;
}
else
{
return null;
}
},

Buang: function(index){

if (index > -1 && index ? this._Panjang)
{
var NodeTanda = this._Kepala, i = 0;

if (index === 0)
{
this._Kepala = NodeTanda.next;
if (!this._Kepala)
{
this._Ekor = null;
}
else
{
this._Kepala.prev = null;
}

}
else
if (index === this._Panjang -1)
{
NodeTanda = this._Ekor;
this._Ekor = NodeTanda.prev;
this._Ekor.next = null;
}
else
{
while(i++ ? index)
{
NodeTanda = NodeTanda.next;
}
NodeTanda.prev.next = NodeTanda.next;
}
this._Panjang--;
return NodeTanda.data;

}
else
{
return null;
}


},

Ukuran: function(){
return this._Panjang;
},

toArray: function(){
var result = [],
NodeTanda = this._Kepala;

while(NodeTanda){
result.push(NodeTanda.data);
NodeTanda = NodeTanda.next;
}

return result;
},

toString: function(){
return this.toArray().toString();
}
}

var List = new DoublyLinkedList();


List.Tambah("Teknik Informatika");
List.Tambah("Teknik Komputer");
List.Tambah("Komputerisasi Akuntansi");
List.Tambah("Computer Networking");


document.write("Isi LinkedList ?br>");
document.write("--------------- ?br>");
for (i=0; i?4; i++)
{
document.write(List.ItemList(i) + "?br>") ;
}
document.write("--------------- ?br>");


alert("Isi LinkedList Awal =" + List.ItemList(0));
alert("ItemList 1 pada Linked List diBuang, yaitu = " +List.ItemList(1));
List.Buang(1);



document.write("?br>Isi LinkedList Terakhir ?br>");
document.write("--------------- ?br>");
for (i=0; i?4; i++)
{
document.write(List.ItemList(i) + "?br>") ;
}
document.write("--------------- ?br>");

//-->
?/script>
?/body>
?/html>


Hasil Double Linked List

Isi LinkedList
---------------
Teknik Informatika
Teknik Komputer
Komputerisasi Akuntansi
Computer Networking
---------------

Isi LinkedList Terakhir
---------------
Teknik Informatika
Komputerisasi Akuntansi
Computer Networking
null
---------------

Linked List

?html>
?head>
?title>Struktur Data Linked List ?/title>?/head>
?body>
?script language = "JavaScript">
?!--
function LinkedList()
{
this._panjang = 0;
this._kepala = null;
}
LinkedList.prototype =
{
construktor : LinkedList,
//Membuat Metode Untuk Menambah Data kedalam List
Tambah : function (data)
{
//Membuat Node List
var node = {data:data,next: null },NodeTanda;
//Periksa Isi List
if (this._kepala===null)
{
this._kepala = node;
}
else
{
NodeTanda = this._kepala;
while (NodeTanda.next)
{
NodeTanda = NodeTanda.next;
}
NodeTanda.next = node;
}
this._panjang++;
},
//Membuat Metode Untuk Menunjuk Item Data
Item : function (index)
{
if (index > -1 && index ?this._panjang)
{
var NodeTanda = this._kepala,
i = 0;
while (i ++ ? index)
{
NodeTanda = NodeTanda.next;
}
return NodeTanda.data;
}
else
{
return null;
}

},
//Membuat Metode Untuk Membuang Elemen List
Buang : function (index)
{
if (index > -1 && index ? this._panjang)
{
var NodeTanda = this._kepala,previous,i = 0;
if (index === 0 )
{
this._kepala = NodeTanda.next;
}
else
{
while (i++ ? index)
{
previous = NodeTanda;
NodeTanda = NodeTanda.next;
}
previous.next = NodeTanda.next;
}
this._panjang--;
return NodeTanda.data;
}
else
{
return null;
}
},
//Membuat Metode Untuk Mengetahui Jumlah Elemen List
Ukuran :function()
{
return this._panjang;
},
//Membuat Metode Untuk Membentuk Array
toArray : function()
{
var result = [],
NodeTanda = this._kepala;
while(NodeTanda){
result.push (NodeTanda.data);
NodeTanda = NodeTanda.next;
}
return result;
},
//Membuat Metode Untuk Konversi ke String
toString : function()
{
return this.toArray().toString();
}
};
//Lanjutan
var list = new LinkedList();

list.Tambah("Teknik Informatika");
list.Tambah("Teknik Komputer");
list.Tambah("Komputerisasi Akuntansi");
list.Tambah("Computer Networking");

document.write ("Isi LinkedList ?br>") ;
document.write("----------------?br>");
for(i=0; i?4; i++)
{
document.write(list.Item(i) + "?br>");
}
document.write("----------------?br>");

alert("Isi LinkedList Awal="+ list.Item(0));
alert("Item 1 pada Linked list dibuang,yaitu =" +list.Item(1));
list.Buang(1);


document.write("Isi LinkedList Terakhir ?br>");
document.write("------------------------?br>");
for(i=0;i?4;i++)
{
document.write(list.Item(i) + "?br>");
}
document.write("--------------------?br>");

//-->
?/script>
?/body>
?/html>

Hasil Linked List

Isi LinkedList
----------------
Teknik Informatika
Teknik Komputer
Komputerisasi Akuntansi
Computer Networking
----------------
Isi LinkedList Terakhir
------------------------
Teknik Informatika
Komputerisasi Akuntansi
Computer Networking
null
--------------------

First Queue

?html>
?head>
?title>Program Queue dengan shift dan unshift javascript?/title>
?script language = "javascript">
function DataQueue()
{
var queue = [];
queue.unshift(1);
queue.unshift(2);
var i = queue.pop();
document.write(i + "?br/>");
queue.unshift(3);
queue.unshift(4);
var i = queue.pop();
document.write(i + "?br/>");
}
?/script>
?/head>
?body>
?form name="FormStrukturData">
?input name="btnQueue" value="Queue" type="button" onClick="DataQueue();"/>
?/form>
?/body>
?/html>

Queue_2

?html>
?head>
?title>Struktur Data Queue?/title>
?script language = "javascript">
var queue=[];
function Masuk_Antrian(data)
{
queue.unshift(data);
}
function Keluar_Antrian()
{
var yang_keluar_antrian= queue.pop();
if(queue.length == 0)
return "Antrian sudah Kosong";
else
return yang_keluar_antrian;
}
function Dalam_Antrian(list)
{
list.options.length=0;
for (var i = 0; i? queue.length;i++)
{
var data = new Option(queue[i]);
list.options[list.options.length] = data;
}
}
?/script>
?/head>
?body>
?form>
?input type=text name=textSimpan>
?input type=button value="Masuk Antrian"
onClick='Masuk_Antrian(textSimpan.value);
textSimpan.value="";
Dalam_Antrian(Visualisasi);'>
?select name="Visualisasi" size = 12>
?option>Isi Antrian....
?/select>
?input type = text name=textAmbil size=20>
?input type= button value="Keluar Antrian"
onClick='textAmbil.value=Keluar_Antrian();
Dalam_Antrian(Visualisasi);'>
?/form>
?/body>
?/html>

Stack_2

?html>
?head>
?title>Struktur Data Stack?/title>
?script language = "JavaScript">
var stack = new Array();
function Input_ke_Stack(data)
{
stack.push(data);
}
function Ambil_dari_Stack()
{
var data_dari_stack = stack.pop();
if(data_dari_stack == undefined)
return "Stack Sudah Kosong";
else
return data_dari_stack;
}
function TampilkanStack(list)
{
list.options.length = 0;
for (var i = 0; i ? stack.length; i++)
{
var data = new Option(stack[i]);
list.options[list.options.length] = data;

}
}
?/script>
?/head>
?body>
?form>
?input type = text name=textSimpan>
?input type = button value="Masukkan Ke Stack"
onClick='Input_ke_Stack(textSimpan.value);
textSimpan.value="";
TampilkanStack(medialist);'>
?select name="medialist" size=12>
?option>Tampilan data....
?/select>
?input type=text name=textAmbil size=20>
?input type=button value="Ambil dari Stack"
onClick="textAmbil.value = Ambil_dari_Stack();
TampilkanStack(mediaList);">
?/form>
?/body>
?/html>

Stack1

?html>
?head>
?title>Contoh Implementasi Push dan POP pada Stack?/title>
?/head>
?body>
?script type="text/javascript">
var stack = new Array;
stack.push("A");
stack.push("B");
stack.push("C");
document.write("stack:"+stack.toString()+"?br>");

var Yangdiambil = stack.pop();
document.write("Data Yang Diambil : "+Yangdiambil);
document.write("?br>");
document.write("Isi Stack Terakhir:"+stack.toString());
?/script>
?/body>
?/html>

Array

<html>
<head>
<title>Parameter Array</title>
</head>
<body>
<SCRIPT LANGUAGE = "JavaScript">
<!--
var tempat = [];
var data = prompt("Ketik Jumlah Maksimum Array :");
for (m=1; m<=data; m++)
{
var bil = prompt("Masukkan Bilangan : ");
tempat[m]=bil;
}
for (n=1; n<=data; n++)
{
document.write("Elemen Array ("+n+") = " +tempat[n] + "<br>");
}
//-->
</SCRIPT>
</body>
</html>

Menghitung Deret Fibonacci
<html>
<head>
<title>Deret Fibonacci</title>
</head>
<script>
<!--
function fibonacci(n)
{
var i ;
var array_fib = new Array();
array_fib.push(0);
array_fib.push(1);

for (i=0; i<=n; i++)
{
array_fib.push(array_fib[0] + array_fib[1]);
array_fib.shift();
}
return array_fib[0];
}
for(i=0; i<=20; i++)
{
document.write("Fibonacci(" +i+ ") = " +fibonacci(i) + "<br>");
}
//-->
</script>
</head>
<body>
</body>
</html>