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

Overview/Description
Expected Duration
Lesson Objectives
Course Number
Expertise Level

Overview/Description

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.

Expected Duration (hours)
1.6

Lesson Objectives

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

• 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
• Course Number:
it_jddsajdj_02_enus

Expertise Level
Beginner