Analisa amorized pada algoritma penyajian pohon splay dan implementasinya dengan struktur data

Abstract

Splay trees are one of binary search tree modification that can improve its trees structure by being self adjusting. In this process, nodes that are frequently accessed are lifted up become the root of modification binary search tree and inactive nodes, on the other hand, move by being self adjusting, Splay trees give a data structure of binary tree that always change according to requirement of its access node. Later in this section, however, with using process of amortized analysis can be proved that running time of every shape of splay tree doesnot exceed 0( lg n ). This document is Undip Institutional Repository Collection. The author(s) or copyr-lis agree that UNDIP-IR may, without changing the content, translate the submission to any medium or format for the purpose of preservation. The author(s) or copyright owner(s) also agree that UNDIP-IR may keep more than one copy of this submission for purpose of security, back-up and preservation: ( http://eprints.undip.acid )