Linked List Data Structure using Python

Linked List Data Structure using Python, available at $69.99, has an average rating of 4.65, with 57 lectures, based on 345 reviews, and has 21013 subscribers.

You will learn about Have a good understanding on linked list Be able to write your own linked lists in Python Understand different types of linked lists such as Singly Linked List, Doubly Linked List and Circular Linked List Get better at problem solving in Python Leverage your Python programming skills This course is ideal for individuals who are Students who would like to enhance their problem solving skills or Students who are looking for a course to learn linked lists It is particularly useful for Students who would like to enhance their problem solving skills or Students who are looking for a course to learn linked lists.

Enroll now: Linked List Data Structure using Python

Summary

Title: Linked List Data Structure using Python

Price: $69.99

Average Rating: 4.65

Number of Lectures: 57

Number of Published Lectures: 57

Number of Curriculum Items: 57

Number of Published Curriculum Objects: 57

Original Price: $74.99

Quality Status: approved

Status: Live

What You Will Learn

Have a good understanding on linked list

Be able to write your own linked lists in Python

Understand different types of linked lists such as Singly Linked List, Doubly Linked List and Circular Linked List

Get better at problem solving in Python

Leverage your Python programming skills

Who Should Attend

Students who would like to enhance their problem solving skills

Students who are looking for a course to learn linked lists

Target Audiences

Students who would like to enhance their problem solving skills

Students who are looking for a course to learn linked lists

If you have started using Python, by now you must have come to know?the simplicity of the language.

This course is designed to help you get more comfortable with programming in Python. It?covers completely, the concept of linked list using Python as the primary language.

Along with their Python implementation, you will learn the essence of linked list?by understanding the different types of linked lists?such as

1. Singly Linked List
2. Doubly Linked List
3. Circular Linked List

You need to be equipped with the basics of Python such as variables, lists, dictionary and so on.

You also need to be familiar with?object oriented programming in Python such as classes and objects,?inheritance, etc.

This course will teach you:

How a linked list differs from the built-in list type of Python

The concept of linked list is explained from scratch and then you will move on to creating your own linked list in Python

Different cases of insertions and deletions in a linked list will be covered. For each of such case, we will write programs in Python

You will find sections on brain teasers to get you thinking. The problem statement will be given for which you will first understand the logic and then write a solution?in Python to improve your logical thinking.

You are comfortable with the basics of Python. Why not leverage your Python skills by hitting the enrol?button? I hope to see you on the inside.

Course Curriculum

Chapter 1: Introduction and Course Structure

Lecture 1: Introduction and Course Structure

Chapter 2: Installation of Python (if you havent already)

Lecture 1: Installation for Windows

Lecture 2: Installation for Mac

Lecture 3: Installation for Linux

Chapter 3: The need to go for a Linked List

Lecture 1: The need to go for a Linked List

Chapter 4: Singly Linked List

Lecture 1: Understanding a Singly Linked List

Lecture 2: Implementing a Singly Linked List

Lecture 3: Inserting a new node as the Head node

Lecture 4: Implementation of inserting a new Head node

Lecture 5: Inserting a new node in between two other nodes

Lecture 6: Implementation of inserting node in between two other nodes

Lecture 7: Deleting a node from the end of the list

Lecture 8: Implementation of last node deletion

Lecture 9: Deleting the Head node

Lecture 10: Implementation of Head node deletion

Lecture 11: Delete a node thats in between two other nodes

Lecture 12: Implementation of deletion of node in between two other nodes

Lecture 13: Limitations of a Singly Linked List

Chapter 5: Brain Teasers – Singly Linked List

Lecture 1: Detect a cycle between the nodes of a Singly Linked List

Lecture 2: Implementation of detecting a cycle between nodes

Lecture 3: Swap two nodes of a Singly Linked List

Lecture 4: Implementation of swapping two nodes

Lecture 5: Sort a Singly Linked List

Lecture 6: Implementation of sorting a Singly Linked List

Lecture 7: Remove duplicate nodes from a sorted Singly Linked List

Lecture 8: Implementation of removing duplicate nodes

Lecture 9: Merge two sorted Singly Linked Lists

Lecture 10: Implementation of merging two sorted Singly Linked Lists

Chapter 6: Doubly Linked List

Lecture 1: Understanding a Doubly Linked List

Lecture 2: Implementing a Doubly Linked List

Lecture 3: Inserting a new node as the head node in a Doubly Linked List

Lecture 4: Implementation of Head node insertion in a Doubly Linked List

Lecture 5: Inserting a new node in between two other nodes of a Doubly Linked List

Lecture 6: Implementation of new node insertion between two other nodes

Lecture 7: Delete a node from the end of a Doubly Linked List

Lecture 8: Delete the Head node of a Doubly Linked List

Lecture 9: Implementation of Head node deletion in Doubly Linked List

Lecture 10: Delete a node in between two other nodes of a Doubly Linked List

Lecture 11: Implementation of deleting a node that is in between two other nodes

Lecture 12: Limitations of a Doubly Linked List

Chapter 7: Brain Teasers – Doubly Linked List

Lecture 1: Check if the node prior to the middle node is greater than its next

Lecture 2: Implementation to check if the node prior to middle node is greater

Lecture 3: Divide data at node by 2 if the data at node prior to that is an odd number

Lecture 4: Implementation to divide data at node by 2

Lecture 5: Reverse a Doubly Linked List

Lecture 6: Implementation of reversing a Doubly Linked List

Lecture 7: Remove duplicate nodes from an unsorted Doubly Linked List

Lecture 8: Implementation of removing duplicate nodes from an unsorted Doubly Linked List

Lecture 9: Check if a Doubly Linked List is palindrome

Lecture 10: Implementation to check if a Doubly Linked List is palindrome

Chapter 8: Circular Linked List

Lecture 1: Implement a Circular Singly Linked List

Lecture 2: Insert a new node as the Head node of a Circular Singly Linked List

Lecture 3: Delete a node from the end of a Circular Singly Linked List

Lecture 4: Delete the head node of a Circular Singly Linked List

Lecture 5: Limitations of a Circular Singly Linked List

Chapter 9: Congratulations!

Lecture 1: Congratulations!

Chapter 10: Bonus Lecture

Lecture 1: Bonus Lecture

Instructors

Febin George
Software Developer

Rating Distribution

1 stars: 4 votes

2 stars: 4 votes

3 stars: 32 votes

4 stars: 111 votes

5 stars: 194 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!