Data Structures & Algorithms in Java: Working with Singly Linked Lists

Java SE 13
  • 15 Videos | 1h 43m 3s
  • Includes Assessment
  • Earns a Badge
Likes 9 Likes 9
In Java, a linked list is a sequence of nodes, each node is linked to the previous and next node in the sequence. In this course, you'll learn how to implement the singly linked list and write code to perform a range of operations on the linked list. First, you'll gain a conceptual understanding of how a node in a singly linked list allows you to connect to all other nodes using the Next reference. Then you'll move on to examine how to perform common operations on this linked list, such as inserting a new node, searching for a node, counting nodes, and deleting nodes. For each of these operations, you'll learn to assess the time complexity of the code that you’ve written.

WHAT YOU WILL LEARN

  • discover the key concepts covered in this course
    recognize the basic structure of the linked list
    insert a node into a linked list
    search for a node with specific data in a linked list
    delete a node from a linked list
    count the number of nodes in a linked list
    set up the basic structure of a singly linked list node
    insert a new node at the head and count the number of nodes in a singly linked list
  • insert a new node at the tail of the linked list
    insert a new node at a specified index
    implement the pop and contains operations on a linked list
    delete a node from a linked list and rewire the list
    find all nodes less than a certain value in a linked list
    recall the differences between arrays and linked lists
    summarize the key concepts covered in this course

IN THIS COURSE

  • Playable
    1. 
    Course Overview
    1m 58s
    UP NEXT
  • Playable
    2. 
    Introducing Linked Lists
    7m 30s
  • Locked
    3. 
    Inserting a Node
    7m 5s
  • Locked
    4. 
    Searching for a Node
    3m 32s
  • Locked
    5. 
    Deleting a Node
    6m 10s
  • Locked
    6. 
    Counting Nodes
    5m 18s
  • Locked
    7. 
    Setting Up a Linked List Node
    9m 14s
  • Locked
    8. 
    Insertion at the Linked List Head & Counting Nodes
    10m 52s
  • Locked
    9. 
    Insertion of Nodes at the Linked List Tail
    8m 9s
  • Locked
    10. 
    Insertion of Nodes at a Specified Index
    8m 52s
  • Locked
    11. 
    Implementing Pop and Contains Operations
    7m 8s
  • Locked
    12. 
    Deleting a Node from a Linked List
    6m 57s
  • Locked
    13. 
    Finding All Nodes Less Than a Value
    3m 25s
  • Locked
    14. 
    Arrays vs. Linked Lists
    8m 44s
  • Locked
    15. 
    Course Summary
    1m 40s

EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE

Skillsoft is providing you the opportunity to earn a digital badge upon successful completion of this course, which can be shared on any social network or business platform

Digital badges are yours to keep, forever.