Book Image

Hands-On Data Structures and Algorithms with Kotlin

By : Chandra Sekhar Nayak, Rivu Chakraborty
Book Image

Hands-On Data Structures and Algorithms with Kotlin

By: Chandra Sekhar Nayak, Rivu Chakraborty

Overview of this book

Data structures and algorithms are more than just theoretical concepts. They help you become familiar with computational methods for solving problems and writing logical code. Equipped with this knowledge, you can write efficient programs that run faster and use less memory. Hands-On Data Structures and Algorithms with Kotlin book starts with the basics of algorithms and data structures, helping you get to grips with the fundamentals and measure complexity. You'll then move on to exploring the basics of functional programming while getting used to thinking recursively. Packed with plenty of examples along the way, this book will help you grasp each concept easily. In addition to this, you'll get a clear understanding of how the data structures in Kotlin's collection framework work internally. By the end of this book, you will be able to apply the theory of data structures and algorithms to work out real-world problems.
Table of Contents (16 chapters)
Free Chapter
Section 1: Getting Started with Data Structures
Section 2: Efficient Grouping of Data with Various Data Structures
Section 3: Algorithms and Efficiency
Section 4: Modern and Advanced Data Structures

Getting started with LinkedList

We can define a LinkedList as a data structure that's linear in nature and all of the elements establish a link to their next element. These are few properties we can find in a LinkedList:

  • Along with a value, each element in a LinkedList is responsible for holding the reference of the next element.
  • As all elements hold multiple things in them, generally they're all objects and are called node instead of the element.
  • The first node is called the head of the LinkedList.
  • The last node has a null reference as there's no next node.
  • All nodes in a LinkedList aren't stored in a contiguous memory location.

Based on the technique used to link the nodes of a LinkedList, we can categorize them into the following types:

  • Singly Linked List
  • Doubly Linked List
  • Circular Linked List

Let's explore each of these types in detail.