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 [...]
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 [...]
128. Implementing a custom pattern-based ObjectInputFilter Let’s assume that we already have the Melon class and the helper methods for serializing/deserializing objects to/from byte arrays from Problem 124.Creating a pattern-based [...]
130. Implementing a custom method ObjectInputFilter Let’s assume that we already have the Melon class and the helper methods for serializing/deserializing objects to/from byte arrays from Problem 124.An ObjectInputFilter can [...]
132. Avoiding StackOverflowError at deserialization Let’s consider the following snippet of code: // ‘mapOfSets’ is the object to serialize/deserializeHashMap<Set, Integer> mapOfSets = new HashMap<>();Set<Set> set = new HashSet<>();mapOfSets.put(set, 1);set.add(set); And, [...]
137. Introducing Java Native Interface (JNI) Java Native Interface (JNI) was the first Java API meant to act as a bridge between JVM bytecode and the native code written in [...]