Implementation Binary Search Tree Data Structure in Simulation Prefix, Infix, Postfix

Setiawan, Iwan (2011) Implementation Binary Search Tree Data Structure in Simulation Prefix, Infix, Postfix. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

[img]
Preview
Text (COVER)
06.02.0014 Iwan Setiawan COVER.pdf

Download (695kB) | Preview
[img] Text (BAB I)
06.02.0014 Iwan Setiawan BAB I.pdf
Restricted to Registered users only

Download (91kB)
[img] Text (BAB II available document only in library of Soegijapranata Catholic University)
06.02.0014 Iwan Setiawan BAB II.pdf
Restricted to Repository staff only

Download (107kB)
[img] Text (BAB III available document only in library of Soegijapranata Catholic University)
06.02.0014 Iwan Setiawan BAB III.pdf
Restricted to Repository staff only

Download (148kB)
[img] Text (BAB IV available document only in library of Soegijapranata Catholic University)
06.02.0014 Iwan Setiawan BAB IV.pdf
Restricted to Repository staff only

Download (133kB)
[img] Text (BAB V available document only in library of Soegijapranata Catholic University)
06.02.0014 Iwan Setiawan BAB V.pdf
Restricted to Repository staff only

Download (220kB)
[img] Text (BAB VI)
06.02.0014 Iwan Setiawan BAB VI.pdf
Restricted to Registered users only

Download (89kB)
[img]
Preview
Text (DAFTAR PUSTAKA)
06.02.0014 Iwan Setiawan DAFTAR PUSTAKA.pdf

Download (89kB) | Preview

Abstract

We usually more easyer learn some thing if has a simulation. The simulation will make we easy imagination some think so we can fast learn about it. Postfix, infix, prefix is the algorithms to read the binary search tree. Binary search tree is a tree data structure in which each node has at most two chiled nodes, usually distinguished as "left" and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents. Outside the tree, there is often a reference to the "root" node (the ancestor of all nodes), if it exists. Any node in the data structure can be reached by starting at root node and repeatedly following references to either the left or right child. This program is make the simulation to make a biary search tree and animaton to postfix, infix, prefix algorithms for read the binary search tree.

Item Type: Thesis (Other)
Subjects: 000 Computer Science, Information and General Works > 005 Computer programming, programs & data
Divisions: Faculty of Computer Science
Depositing User: Mr Ign. Setya Dwiana
Date Deposited: 27 Jan 2016 02:13
Last Modified: 27 Jan 2016 02:13
URI: http://repository.unika.ac.id/id/eprint/7535

Actions (login required)

View Item View Item