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 [...]
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 [...]
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 [...]
120. Introducing the Splay Tree data structure A Splay Tree is a flavor of Binary Search Tree (BST). Its particularity consists of the fact that it is a self-balancing tree [...]
122. Introducing the Unrolled Linked List data structure An Unrolled Linked List is a flavor of a linked list that stores arrays (multiple items). Each node of an Unrolled Linked [...]
123. Implementing joins algorithms Joins algorithms are typically used in databases. Mainly, we have two tables in a one-to-many relationship and we want to fetch a result set containing this [...]
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, [...]
134. Introducing JDK 17 easy filter creation Starting with JDK 17, we can express filters more intuitively and readable via two convenient methods named allowFilter() and rejectFilter(). And, since the [...]