Data Structures in Java for Noobs (Lite Edition)

Introduction to a Dummy Node Singly Linked List. Intro to the methods,fields, and constructor's that we will be implementing within our Singly Linked List Implementation

Creating our Node Class for our Dummy Node Implementation of our Singly Linked List. Creating our Linked List Class as well as creating our fields for our Linked List Class and Node Class

We will be implementing our toString method for of dummy node implementation for our singly linked list. We will also be implementing our getSize method for our linked list

We will be implementing our append method for of dummy node implementation for our singly linked list. The append method will add to the back of our linked list

We will be implementing our removeLast method for of dummy node implementation for our singly linked list. The removeLast method will remove the last node that is on our linked list.

We will be implementing our insertAt method for of dummy node implementation for our singly linked list. The insertAt method will insert a node at a particular index.

We will be implementing our removeAt method for of dummy node implementation for our singly linked list. The removeAt method will remove a node at a particular index.

Students will learn what a doubly linked list is and what methods we will be implementing for our doubly linked list.

We will be setting up so we can create our doubly linked list.

We will be implementing our prepend method for of dummy node implementation for our doubly linked list. The prepend method adds a node to the front of the list

We will be implementing our append method for of dummy node implementation for our doubly linked list. The append method will add a node to the back of our doubly linked list.

We will be implementing our removeFirst method for of dummy node implementation for our doublylinked list. The removeFirst method removes the first node from the doubly linked list

We will be implementing our removeLast method for of dummy node implementation for our doubly linked list. The removeLast method will remove the last method for our doubly linked list implementation.

We will be implementing our insertAt method for of dummy node implementation for our doubly linked list. The insertAt method will insert a node at a particular index within our doubly linked list.

We will be implementing our removeAt method for of dummy node implementation for our doubly linked list. The removeAt method will remove the node at a certain index within our doubly linked list.

We will be implementing our printReverse method for of dummy node implementation for our doubly linked list. The printReverse method will print our doubly linked list backwards.

Coupon Code for the full course if you are interested is listed below. Usually at 20 bucks but you can have it for 10
https://www.udemy.com/data-structures-in-java-for-noobs-programming-beginners/?couponCode=lite10

Another free course I teach on the basics of java can be found here.
https://www.udemy.com/java-for-noobs-beginners/

Thank you for taking the Course.