PRAKTIKUM ALGORITMA DAN STRUKTUR DATA MODUL KE-7 BINARY TREE

LABORATORIUM PEMROGRAMAN PROGRAM STUDI TEKNIK INFORMATIKA FAKULTAS TEKNIK UNIVERSITAS MUHAMMADIYAH MALANG 2011

I. TUJUAN
Mahasiswa mampu : 1. Memahami struktur data binary tree 2. Menerapkan binary tree dalam pemrograman 3. Memahami struktur data binary search tree dan operasi-operasinya 4. Menerapkan binary search tree dan operasi-operasinya dalam pemrograman 5. Memahami algoritma transversal pada pohon biner 6. Menerapkan transversal pohon biner dalam pemrograman

II. ALAT YANG DIGUNAKAN

Peralatan yang digunakan : 1. Perangkat PC yang terinstall Java 2. Editor Java

III. DASAR TEORI

(Disesuaikan dengan yang telah diberikan di kelas) [Konsep struktur data binary tree] [Binary search tree dan operasi-operasinya] [Transversal pada pohon biner]

IV. PROSEDUR PELAKSANAAN

Prosedur pelaksanaan praktikum adalah sebagai berikut : 1. Mahasiswa mencoba latihan yang ada pada modul praktikum 2. Mahasiswa menganalisa hasil dari program pada latihan yang telah dijalankan 3. Mahasiswa mengerjakan tugas yang diberikan 4. Mahasiswa mendemonstrasikan program yang telah dikerjakan pada dosen/assisten 5. Mahasiswa membuat laporan dari praktikum dan tugas yang telah dikerjakan 6. Upload laporan melalui e-labit.umm.ac.id

V. LATIHAN
Petunjuk : Cobalah contoh program yang ada pada latihan di bawah ini di laboratorium. Mintalah bimbingan kepada asisten/dosen jika ada kesulitan. Analisa program tersebut untuk dapat mengerjakan tugas praktikum dengan mudah.

1. Representasi Binary Tree dengan Array

public class ArrayBinaryTree { // data members static Object [] a; // array that contains the tree static int last; // position of last element in array a /** visit method that prints the element in a[i] */ public static void visit(int i) {System.out.print(a[i] + " ");} /** inorder traversal */ public static void inOrder(Object [] theArray, int theLast) { // set static data members a = theArray; last = theLast; // start the recursive traversal method at the root theInOrder(1); } /** actual method to do the inorder static void theInOrder(int i) {// traverse subtree rooted at a[i] if (i <= last && a[i] != null) {// root exists theInOrder(2 * i); // visit(i); // theInOrder(2 * i + 1); // } } traversal */

do left subtree visit tree root do right subtree

/** test program */ public static void main(String [] args) { Integer [] a = new Integer [15]; a[1] = new Integer(1); a[2] = new Integer(2); a[5] = new Integer(5); a[10] = new Integer(10); a[11] = new Integer(11); System.out.println("The elements in inorder are"); inOrder(a, 11); System.out.println(); } }

Output Program:

2. Representasi Binary Tree dengan LinkedList

import java.io.*; import java.util.*; // for Stack class //////////////////////////////////////////////////////////////// class Node { public int iData; // data item (key) public double dData; // data item public Node leftChild; // this node's left child public Node rightChild; // this node's right child public void displayNode() // display ourself { System.out.print('{'); System.out.print(iData); System.out.print(", "); System.out.print(dData); System.out.print("} "); } } // end class Node //////////////////////////////////////////////////////////////// class Tree { private Node root; // first node of tree // ------------------------------------------------------------public Tree() // constructor { root = null; } // no nodes in tree yet // ------------------------------------------------------------public Node find(int key) // find node with given key { // (assumes non-empty tree) Node current = root; // start at root while(current.iData != key) // while no match, { if(key < current.iData) // go left? current = current.leftChild; else // or go right? current = current.rightChild; if(current == null) // if no child, return null; // didn't find it } return current; // found it } // end find() // ------------------------------------------------------------public void insert(int id, double dd) { Node newNode = new Node(); // make new node newNode.iData = id; // insert data newNode.dData = dd; if(root==null) // no node in root root = newNode; else // root occupied { Node current = root; // start at root Node parent; while(true) // (exits internally) { parent = current;

if(id < current.iData) // go left? { current = current.leftChild; if(current == null) // if end of the line, { // insert on left parent.leftChild = newNode; return; } } // end if go left else // or go right? { current = current.rightChild; if(current == null) // if end of the line { // insert on right parent.rightChild = newNode; return; } } // end else go right } // end while } // end else not root } // end insert() // ------------------------------------------------------------public boolean delete(int key) // delete node with given key { // (assumes non-empty list) Node current = root; Node parent = root; boolean isLeftChild = true; while(current.iData != key) // { parent = current; if(key < current.iData) // { isLeftChild = true; current = current.leftChild; } else // { isLeftChild = false; current = current.rightChild; } if(current == null) // return false; // } // end while // found node to delete search for node go left?

or go right?

end of the line, didn't find it

// if no children, simply delete it if(current.leftChild==null && current.rightChild==null) { if(current == root) // if root, root = null; // tree is empty else if(isLeftChild) parent.leftChild = null; // disconnect else // from parent parent.rightChild = null; }

// if no right child, replace with left subtree else if(current.rightChild==null) if(current == root) root = current.leftChild; else if(isLeftChild) parent.leftChild = current.leftChild; else parent.rightChild = current.leftChild; // if no left child, replace with right subtree else if(current.leftChild==null) if(current == root) root = current.rightChild; else if(isLeftChild) parent.leftChild = current.rightChild; else parent.rightChild = current.rightChild; else // two children, so replace with inorder successor { // get successor of node to delete (current) Node successor = getSuccessor(current); // connect parent of current to successor instead if(current == root) root = successor; else if(isLeftChild) parent.leftChild = successor; else parent.rightChild = successor; // connect successor to current's left child successor.leftChild = current.leftChild; } // end else two children // (successor cannot have a left child) return true; // success } // end delete() // ------------------------------------------------------------// returns node with next-highest value after delNode // goes to right child, then right child's left descendents private Node getSuccessor(Node delNode) { Node successorParent = delNode; Node successor = delNode; Node current = delNode.rightChild; // go to right child while(current != null) // until no more { // left children, successorParent = successor; successor = current; current = current.leftChild; // go to left child } // if successor not if(successor != delNode.rightChild) // right child, { // make connections successorParent.leftChild = successor.rightChild; successor.rightChild = delNode.rightChild; } return successor;

} // ------------------------------------------------------------public void traverse(int traverseType) { switch(traverseType) { case 1: System.out.print("\nPreorder traversal: "); preOrder(root); break; case 2: System.out.print("\nInorder traversal: "); inOrder(root); break; case 3: System.out.print("\nPostorder traversal: "); postOrder(root); break; } System.out.println(); } // ------------------------------------------------------------private void preOrder(Node localRoot) { if(localRoot != null) { System.out.print(localRoot.iData + " "); preOrder(localRoot.leftChild); preOrder(localRoot.rightChild); } } // ------------------------------------------------------------private void inOrder(Node localRoot) { if(localRoot != null) { inOrder(localRoot.leftChild); System.out.print(localRoot.iData + " "); inOrder(localRoot.rightChild); } } // ------------------------------------------------------------private void postOrder(Node localRoot) { if(localRoot != null) { postOrder(localRoot.leftChild); postOrder(localRoot.rightChild); System.out.print(localRoot.iData + " "); } } // ------------------------------------------------------------public void displayTree() { Stack globalStack = new Stack(); globalStack.push(root); int nBlanks = 32; boolean isRowEmpty = false; System.out.println( "......................................................"); while(isRowEmpty==false)

{ Stack localStack = new Stack(); isRowEmpty = true; for(int j=0; j<nBlanks; j++) System.out.print(' '); while(globalStack.isEmpty()==false) { Node temp = (Node)globalStack.pop(); if(temp != null) { System.out.print(temp.iData); localStack.push(temp.leftChild); localStack.push(temp.rightChild); if(temp.leftChild != null || temp.rightChild != null) isRowEmpty = false; } else { System.out.print("--"); localStack.push(null); localStack.push(null); } for(int j=0; j<nBlanks*2-2; j++) System.out.print(' '); } // end while globalStack not empty System.out.println(); nBlanks /= 2; while(localStack.isEmpty()==false) globalStack.push( localStack.pop() ); } // end while isRowEmpty is false System.out.println( "......................................................"); } // end displayTree() // ------------------------------------------------------------} // end class Tree //////////////////////////////////////////////////////////////// class TreeApp { public static void main(String[] args) throws IOException { int value; Tree theTree = new Tree(); theTree.insert(50, theTree.insert(25, theTree.insert(75, theTree.insert(12, theTree.insert(37, theTree.insert(43, theTree.insert(30, theTree.insert(33, theTree.insert(87, theTree.insert(93, theTree.insert(97, 1.5); 1.2); 1.7); 1.5); 1.2); 1.7); 1.5); 1.2); 1.7); 1.5); 1.5);

while(true) { System.out.print("Enter first letter of show, "); System.out.print("insert, find, delete, or traverse: "); int choice = getChar(); switch(choice) { case 's': theTree.displayTree(); break; case 'i': System.out.print("Enter value to insert: "); value = getInt(); theTree.insert(value, value + 0.9); break; case 'f': System.out.print("Enter value to find: "); value = getInt(); Node found = theTree.find(value); if(found != null) { System.out.print("Found: "); found.displayNode(); System.out.print("\n"); } else System.out.print("Could not find "); System.out.print(value + '\n'); break; case 'd': System.out.print("Enter value to delete: "); value = getInt(); boolean didDelete = theTree.delete(value); if(didDelete) System.out.print("Deleted " + value + '\n'); else System.out.print("Could not delete "); System.out.print(value + '\n'); break; case 't': System.out.print("Enter type 1, 2 or 3: "); value = getInt(); theTree.traverse(value); break; default: System.out.print("Invalid entry\n"); } // end switch } // end while } // end main() // ------------------------------------------------------------public static String getString() throws IOException { InputStreamReader isr = new InputStreamReader(System.in); BufferedReader br = new BufferedReader(isr); String s = br.readLine(); return s; }

// ------------------------------------------------------------public static char getChar() throws IOException { String s = getString(); return s.charAt(0); } //------------------------------------------------------------public static int getInt() throws IOException { String s = getString(); return Integer.parseInt(s); } // ------------------------------------------------------------} // end class TreeApp ////////////////////////////////////////////////////////////////

Output program:

VI. TUGAS PRAKTIKUM

1. Buatlah program binary tree menggunakan array yang dapat menyimpan data berupa string! 2. Buatlah program binary tree menggunakan linked list yang dapat menyimpan data berupa string! 3. Modifikasilah program latihan-1 sehingga menjadi binary search tree, dan lengkapi dengan operasi-operasi (menu) berikut: Display data Insert Remove (simpul daun, 1-degree, 2-degree) Find Transversal (levelOrder, inOrder, preorder, dan postOrder) 4. Modifikasilah program latihan-2, sehingga: Dapat menampilkan hasil transversal levelOrder Ketika simpul dengan 2-Degree dihapus, maka simpul yang menggantikan adalah simpul terbesar pada subtree kiri. 5. Anggaplah data yang disimpan adalah jalur titik lokasi. tambahkan menu path searching untuk melakukan pencarian jalur dari satu titik ke titik tertentu. Syarat penelusuran: titik awal dimulai dari root (mencari garis keturunan atau descendant) Misalkan dari titik A (root) menuju ke titik D jalur yang dilalui adalah A,B,C,D. dan seterusnya.

VII. HASIL PRAKTIKUM

[Print-screen output latihan 1-2 di sini] [Tuliskan source code dan hasil tugas praktikum di sini]

VIII. KESIMPULAN
[Kesimpulan tidak boleh sama antar mahasiswa, meskipun dalam 1 kelompok] TUGAS AKHIR PRAKTIKUM: Mengumpulkan portofolio laporan praktikum ASD dengan format sebagi berikut: Cover Kata Pengantar Daftar Isi Laporan Praktikum 1 Laporan Praktikum 2 Laporan Praktikum 3 Laporan Praktikum 4 Laporan Tugas Pengganti modul 5 & 6 Laporan Praktikum 7 Penutup (berisi kesimpulan secara umum dan saran) Dikumpulkan sesuai dengan kelompoknya masing-masing dalam bentuk CD yang berisi portofolio laporan dan sourcecode program. Dikumpulkan pada minggu terakhir sebelum UAS sesuai dengan jadwal praktikum.