Data structures and algorithms are among the most fundamental concepts of Computer Science. Whether it’s real-world problems you’re trying to solve or the typical coding question asked in an interview, almost every problem requires you to demonstrate a deep understanding of data structures and algorithms. 

This course is a detailed review of some of the most common data structures and algorithms that you’ll see in interviews and your everyday work. With implementation details, thorough explanations, and hands-on coding exercises, you’ll quickly gain the confidence you need to solve any problem, no matter the situation.

Data Structures and Algorithms in Python

In the previous lesson, we defined our `Node` and `LinkedList` classes. In this lesson, we'll implement the class methods to insert elements in a linked list:
1. `append`
2. `prepend`
3. `insert_after_node`

 
## Append

The `append` method will insert an element at the end of the linked list. Below is an illustration which depicts the append functionality:


In the previous lesson, we defined our `Node` and `LinkedList` classes. In this lesson, we'll implement the class methods to insert elements in a linked list:
1. `append`
2. `prepend`
3. `insert_after_node`

 
# Append

The `append` method will insert an element at the end of the linked list. Below is an illustration which depicts the append functionality:


In this lesson, we'll learn how to insert elements in a linked list at different places. 

Introduction

Stack

Singly Linked Lists

Circular Linked Lists

Doubly Linked Lists

Arrays

Binary Trees

Binary Search Trees

Binary Search

Recursion

String Processing

Insertion

Append #