113. Introducing the Skip List data structure The Skip List data structure is a probabilistic data structure built on top of a linked list. A Skip List uses an underlying [...]
Done! So inserting has two simple rules:We compare components alternatively starting with x. At level one, we compare x, at level two, we compare y, at level three we compare [...]
114. Introducing the K-D-trees data structure A K-D Tree (also referred to as a K-Dimensional tree) is a data structure that is a flavor of Binary Search Tree (BST) dedicated [...]
The remaining code handles the initialization of children in a lazy fashion (on demand): @Override public Collection<? extends Zippable> getChildren() { lazyGetChildren(); return (children != null) ? new LinkedList<>(Arrays.asList(children)) [...]
115. Introducing the Zipper data structure The Zipper data structure is meant to facilitate cursor-like navigation capabilities over another data structure such as a tree. Moreover, it may provide capabilities [...]
Implementing unionHeap(BinomialHeap heap) Consider two Binomial Heaps (H1 and H2). The goal of the union operation is to create H3 by unifying H1 with H2. Let’s assume that H1 (having [...]
Implementing findMin() Finding the minimum key of a Binomial Heap requires us to loop the root list (which is a linked list) and find the smallest key. This can be [...]
116. Introducing the Binomial Heap data structure A Binomial Heap data structure is a set composed of Binomial Trees. Each Binomial Tree is a Min Heap which means that it [...]
117. Introducing the Fibonacci Heaps data structure A Fibonacci Heap is a flavor of Binomial Heap with excellent performance in amortized time for operations such as insert, extract minimum and [...]
119. Introducing the Huffman Coding data structure The Huffman Coding algorithm was developed by David A. Huffman in 1950 and it can be easily understood via an example. Let’s assume [...]