HOME > Development > Data Structures From Scratch

Data Structures From Scratch

  • Development
  • May 05, 2025
SynopsisData Structures From Scratch, available at $19.99, has an ave...
Data Structures From Scratch  No.1

Data Structures From Scratch, available at $19.99, has an average rating of 4.2, with 53 lectures, based on 30 reviews, and has 523 subscribers.

You will learn about apply data structure concepts in different applications of computer science compare and contrast different data structure based on application write their own algorithms and can analyse between different algorithm implement various algorithms in programming language develop planning skills required for datastructure This course is ideal for individuals who are This data structure course is meant for those who are familiar with basic understanding of programming. It is particularly useful for This data structure course is meant for those who are familiar with basic understanding of programming.

Enroll now: Data Structures From Scratch

Summary

Title: Data Structures From Scratch

Price: $19.99

Average Rating: 4.2

Number of Lectures: 53

Number of Published Lectures: 53

Number of Curriculum Items: 53

Number of Published Curriculum Objects: 53

Original Price: $34.99

Quality Status: approved

Status: Live

What You Will Learn

  • apply data structure concepts in different applications of computer science
  • compare and contrast different data structure based on application
  • write their own algorithms and can analyse between different algorithm
  • implement various algorithms in programming language
  • develop planning skills required for datastructure
  • Who Should Attend

  • This data structure course is meant for those who are familiar with basic understanding of programming.
  • Target Audiences

  • This data structure course is meant for those who are familiar with basic understanding of programming.
  • Data structure is an efficient way of organizing data and keeping the mess out of your system. This course teaches further about these data structures. The most popular data structures in store data category include binary search trees, hash tables, heaps, and graphs. After learning the codes, you will be able to develop your knowledge side by side with your teacher. There are lot of other courses on data structures so why take this course?? (1. Teaching Style + Side by Side Coding with Theory 2. No use of traditional powerpoint slides)

    This course was primarily made for those with basic knowledge of C++ that want to improve in computer science.

    What is the working system of this course?

  • Providing the illustration and examples for better understanding

  • Easy lectures for beginners?

  • Complete detailed explanation of data structures?

  • Code in C++?

  • What does this course cover?

  • Arrays

  • Stacks

  • Abstract data type

  • Queues

  • LinkedList

  • Recursion

  • Trees and other algorithms

  • Hash Tables and Graphs (To be covered soon)

  • After completing the course, you will have enough knowledge to code these data structures on your own and be confident enough to perform your own data structural operations. Its purpose is to facilitate the introduction to programming and exercise the strategies. When designing or using a library, two things are fundamental: time efficiency operations with objects of classes and memory management. The C ++ is a language that tends to be very effective in these areas. This course is crucial in all these categories and will help you learn in the easiest possible way.

    Knowing the basic techniques used during intermediate generation, optimization and code generation expanding programming techniques is the plot of computer science that you will always come back to.

    Course Curriculum

    Lecture 1: Introduction To Data Structures

    Lecture 2: Abstract Data Type

    Lecture 3: Basics of Array

    Lecture 4: Concept of Addresses in One Dimensional Array

    Lecture 5: One Dimensional Array in C++

    Lecture 6: Basics of Two Dimensional Array

    Lecture 7: Memory Representation of Two Dimensional Array

    Lecture 8: Two Dimensional Array in C++

    Lecture 9: List as an Abstract Data Type

    Chapter 1: List And Arrays

    Lecture 1: Array List in C++

    Chapter 2: Linked List and Analyses

    Lecture 1: Array based Linked List and intuition

    Lecture 2: Dynamic Linked List

    Lecture 3: Linked List traversal

    Lecture 4: Linked List insert at last

    Lecture 5: Linked List Insertion at Middle

    Lecture 6: Delete Node from Linked List

    Lecture 7: Analyses of Linked List

    Lecture 8: Recursion

    Chapter 3: Stacks

    Lecture 1: Basics of Stack

    Lecture 2: Stack Operation

    Lecture 3: Stacks using Linked List

    Lecture 4: Application of Stacks : Factorial

    Lecture 5: Application of Stacks: Arithmetic

    Lecture 6: a. Infix to Postfix

    Lecture 7: b. Infix to Postfix

    Lecture 8: c. Infix to Postfix

    Lecture 9: Algorithim to convert Infix to Postfix

    Lecture 10: Evaluation of Postfix

    Chapter 4: Queues

    Lecture 1: Introduction to Queue

    Lecture 2: Queue Illustration

    Lecture 3: Array Based Implementation of Queue

    Lecture 4: C++ Tutorial on Queue

    Chapter 5: Trees

    Lecture 1: Introduction To Trees

    Lecture 2: Classification of Trees and Introduction to Binary Trees

    Lecture 3: Representation of Binary Trees : Array Based Approach

    Lecture 4: Linked/Dynamic Representation of Binary Trees

    Lecture 5: Tree Traversal : Inorder

    Lecture 6: Tree Traversal : Preorder

    Lecture 7: Tree Traversal: Post Order

    Lecture 8: Expression Trees

    Lecture 9: Algorithm To Build Expression Tree

    Lecture 10: Implementing Binary Trees

    Lecture 11: C++ Implementation of Binary Trees

    Chapter 6: Binary Search Trees

    Lecture 1: Introduction to Binary Search Tree

    Lecture 2: BST: Search Item

    Lecture 3: BST: Insertion

    Chapter 7: AVL Trees

    Lecture 1: Introduction To AVL Trees

    Lecture 2: Why AVL Trees?

    Lecture 3: AVL Trees Rule

    Lecture 4: a. Insertion into AVL Trees

    Lecture 5: b. Insertion into AVL Trees

    Lecture 6: AVL Trees Algorithm

    Lecture 7: C++ Implementation of AVL Trees

    Instructors

  • Data Structures From Scratch  No.2
    SaifAli Kheraj
    Instructor
  • Rating Distribution

  • 1 stars: 1 votes
  • 2 stars: 1 votes
  • 3 stars: 3 votes
  • 4 stars: 9 votes
  • 5 stars: 16 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!