Skip List: Linked List ที่มีทางด่วนพิเศษ
Article Sidebar
Main Article Content
Abstract
Skip List is a probabilistic alternative to Balanced Trees, or in short, another linked list which behave like a self-balanced binary search trees. Skip List was created by Professor William Pugh at the University of Maryland in 1990. It has an average running time of n and a linear running time at the worst case. This article will show readers what Skip List is and how it can be created using Java.
Article Details
Section
Academic Articles
1. Any views and comments in the FEU Academic Review Journal are the authors’ views. The editorial staff have not to agree with those views and it is not considered as the editorial’s responsibility.
2. The responsibility of content and draft check of each article belongs to each author. In case, there is any lawsuit about copyright infringement. It is considered as the authors’ sole responsibility.
3. The article copyright belonging to the authors and the Far Eastern University are copyrighted legally. Republication must be received direct permission from the authors and the Far Eastern University in written form.