Working with LinkedList [Java]
Solving LinkedList questions using two pointers
IT & Software,IT certifications,Data Structures
Lectures -5
Duration -32 mins
30-days Money-Back Guarantee
Get your team access to 10000+ top Tutorials Point courses anytime, anywhere.
Course Description
LinkedList is the easiest topic compared with all other DSA topics.
What is LinkedList?
A class/node is created with two elements - data and address. The data field stores some values. The address field will store the address of the node to which it needs to connect.
When several nodes are connected with each other, it forms a Linked List.
Why Linked List?
The array has a size limitation. When we don't know the size of the elements we are going to have, we can't use Arrays. We can use Lists in those situations
Types of Linked Lists:
Simple Linked List – In this type of linked list, one can move or traverse the linked list in only one direction. where the next pointer of each node points to other nodes but the next pointer of the last node points to NULL. It is also called the “Singly Linked List”.
Doubly Linked List – In this type of linked list, one can move or traverse the linked list in both directions (Forward and Backward)
Circular Linked List – In this type of linked list, the last node of the linked list contains the link of the first/head node of the linked list in its next pointer.
Doubly Circular Linked List – A Doubly Circular linked list or a circular two-way linked list is a more complex type of linked list that contains a pointer to the next as well as the previous node in the sequence. The difference between the doubly linked and circular doubly list is the same as that between a singly linked list and a circular linked list. The circular doubly linked list does not contain null in the previous field of the first node.
The pointer approach is the most commonly used approach for all Linked list problems. In this course, we have solved many basic Leetcode questions related to the Linked list.
Who this course is for:
- People who want to learn how Linked List works
Goals
What will you learn in this course:
- How to traverse a LinkedList
- How to use two pointer approach in Linked List
- How to access, add, delete, and add elements in the Linked list
- How to reverse a Linked list
Prerequisites
What are the prerequisites for this course?
Basic OOP concepts like class, methods, etc
Curriculum
Check out the detailed breakdown of what’s inside the course
LinkedList
5 Lectures
- Printing all elements in LinkedList 05:18 05:18
- Delete an element in LinkedList 05:17 05:17
- Find middle element in LinkedList 07:53 07:53
- Remove nth node in LinkedList 08:42 08:42
- Reverse a LinkedList 05:21 05:21
Instructor Details
Monish Njs
eCourse Certificate
Use your certificate to make a career change or to advance in your current career.
Our students work
with the Best
Related Video Courses
View MoreAnnual Membership
Become a valued member of Tutorials Point and enjoy unlimited access to our vast library of top-rated Video Courses
Subscribe nowOnline Certifications
Master prominent technologies at full length and become a valued certified professional.
Explore Now