/kotlin-data-structures

Primary LanguageKotlin

Kotlin Data Structures

Kotlin data structures.

Table of Contents

  • Basics
    • ArrayList
    • Set
    • Map
    • List
    • ArrayDeque
    • Collection
    • Grouping
    • Hash
      • HashMap
      • HashSet
      • LinkedHashMap
      • LinkedHashSet
    • IndexedValue
    • Iterable
      • Iterator
      • ShortIterator
    • RandomAccess
    • Scope Functions
  • Advanced
    • Linked List
    • Stack & Queue
    • Tree
    • Graph
    • Heap
    • Hash Table
    • Trie
    • Binary Search Tree
    • Red-Black Tree
    • AVL Tree
    • B-Tree
    • Segment Tree

Basics Data Structures

ArrayList || MutableList

  • Simple array
  • Remove array elements
  • Slicing arrays
  • Map functions on arrays: map, filter, reduce, any, contains, filterValues,
    • FlatMap functions
    • maxOf and minOf functions
    • onEach function
    • plus on minus function
  • Create an array from range and until functions
  • Tuples in arrays
  • Comparators in arrays

Scope Functions

  • let
  • with
  • apply
  • also

Linked List

  • Singly Linked List. A singly linked list is unidirectional, meaning that it can be traversed in only one direction from head to the last node (tail)
  • Singly Linked List (Uni-directional). A doubly linked list is a list that has two references, one to the next node and another to previous node.
  • Circular Linked List. A circular linked list is a list that has a pointer from the last node to the first node.
  • Doubly Linked List (Bi-directional). A doubly linked list is a list that has two references, one to the next node and another to previous node.

Stacks and Queues

  • Stack
  • Queue

Resources:

Set

TBD

Map

TBD

List

TBD

ArrayDeque

TBD

Collection

TBD