GasaiY2nd

Kode untuk membuat sorting Linkedlist java menggunakan netbean Selamat Mencoba :) public class LinkedlistIS { node head; node sorted; class node { int val; node next; public node(int val) { this.val = val; } } void push(int val) { node newnode = new node(val); newnode.next = head; head = newnode; } void insertionSort(node headref) { sorted = null; node current = headref; while (current != null) { node next = current.next; sortedInsert(current); current = next; } head = sorted; } void sortedInsert(node newnode) { if (sorted == null || sorted.val >= newnode.val) { newnode.next = sorted; sorted = newnode; }else { node current = sorted; while (current.next != null ...

Kode untuk membuat circular singly linked list java menggunakan Netbean Selamat Mencoba :) class SinglyLinkedList { static class Node { int data; Node next; }; static Node addToEmpty(Node last, int data) { if (last != null) return last; Node temp = new Node(); temp.data = data; last = temp; last.next = last; return last; } static Node addBegin(Node last, int data) { if (last == null) return addToEmpty(last, data); Node temp = new Node(); temp.data = data; temp.next = last.next; last.next = temp; return last; } static Node addEnd(Node last, int data) { if (last == null) return addToEmpty(last, data); Node temp = new Node(); temp.data = data; temp.next = last.next; last.next = temp; last = temp; return last; } static Node addAfter(Node last, int data, int item) { if (last == null) return null; Node temp, p; p = last.next; ...

Kode untuk Mengimplementasikan Tree java menggunakan Netbean Selamat Mencoba :) Buatlah Class TreeNode /** * * @author Pangling */ public class TreeNode { int data; TreeNode left; TreeNode right; public TreeNode(int data) { this.data = data; } } Lalu Buat Class BinaryTree, dimana isinya berupa method yang akan di gunakan nanti. /** * * @author Pangling */ public class BinaryTree { TreeNode root; public boolean isEmpty(){ return (root==null); } public void insert(TreeNode input) { if (isEmpty()) { root = input; } else { TreeNode current = root; TreeNode parent = null; boolean diKiri = true; while (current != null) { parent = current; if (current.data < input.data) { current = current.right; diKiri = false; } else if(...

Kode untuk membuat Double Linked List Java menggunakan Netbean Selamat Mencoba :) Buat lah class dengan nama Node /** * * @author Pangling */ public class Node { int data; Node next; Node prev; public Node(int data){ this.data = data; } public void tampil(){ System.out.print("{"+data+"}"); } } Lalu buat class dengan nama DoubleLinkedList. Class ini berisi method method yang akan di gunakan. /** * * @author Pangling */ public class DoubleLinkedList { Node first; Node last; //kontruktor //set nilai awal adalah null public DoubleLinkedList() { first = null; last = null; } //mengecek apakah linked list kosong atau tidak public boolean isEmpty(){ return (first==null); } //method untuk menginsert data dari pertama public void insertFirst(int data){ Node node = new Node(data); if(isEmpty()){ last = node; ...