codedamn logo
codedamn
Course image for Master Non-Linear Data Structures

Master Non-Linear Data Structures

Complete Guide and Hands-on Tutorials on Non-Linear Data Structures

12 hours+ of total content
0.0
0 ratings
18 students enrolled
Course Creator: Piyush Garg

Heads up!

This is an official course from Data Structures And Algorithms Learning Path learning path.

Goals

  • Introduction to Non Linear Data Structures
  • Trees
  • Binary Trees
  • Binary Search Trees
  • Dept First vs Breadth First Search in Trees
  • Pre-Order, Post-Order and InOrder Traversals
  • Mastering Trees using Recursion
  • Self balancing Trees using AVL
  • AVL Tree and Rotations
  • Heaps
  • Max Heap
  • Min Heap
  • Heapify
  • Tries (In Progress)
  • Graphs (Coming Soon)

Description

In this online course "Master Non-Linear Data Structures", you will be introduced to the powerful and versatile world of non-linear data structures. These data structures are essential for solving complex problems in computer science, and are used in various fields such as software development, databases, and artificial intelligence.

You will start by learning about Trees, a basic yet powerful data structure that is used to organize and manage data in a hierarchical structure. You will learn about the different types of Trees, including Binary Search Trees (BST), Binary Trees (BT), and AVL Trees, and how to implement them in code. You will also learn about the various operations that can be performed on Trees, such as insertion, deletion, and search.

Next, you will dive into Heaps, a data structure that allows for efficient access and manipulation of the largest or smallest element. You will learn about the different types of Heaps, such as max-heaps and min-heaps, and how to implement them in code.

You will also learn about Tries, a data structure that is used to efficiently store and search large sets of strings. This data structure is particularly useful in applications such as spell-checking and auto-complete.

Finally, you will delve into Graphs, a data structure that is used to represent relationships between different objects. You will learn about the different types of Graphs, such as undirected and directed graphs, and how to implement them in code. You will also learn about the various algorithms used to traverse and search Graphs, such as depth-first search and breadth-first search.

Throughout the course, you will be solving many challenging coding questions online to solidify your understanding of these complex data structures. The course is designed for experienced programmers who are looking to expand their knowledge and skills. By the end of the course, you will be a master of non-linear data structures and be equipped to tackle even the most complex coding challenges.

Course Structure

59 lectures 12:27:40 total duration

  Introduction 
03:22

Student feedback

0.0
Course Rating

0%

0%

0%

0%

0%

Reviews

No reviews yet

Your Course Instructor

Course Instructor Image

Piyush Garg

Full-stack Developer

Hi, I am Piyush and I love to explore new technologies and frameworks. I work as a freelancer in various domains such as the Backend engineer, AWS Cloud solution architect, etc. Fun fact about me: I am obsessed with clean codes that follow proper design principles and patterns.

Upgrade to codedamn Pro Plan and unlock more courses for accelerated learning. Unlimited courses, interactive learning and more.

Free

  • HD video content
  • Certificate of completion
  • Mentorship from codedamn staff
  • Support over WhatsApp
  • Full learning path unlocked
  • Unlimited hands-on practice

Pro

  • HD video content
  • Certificate of completion
  • Mentorship from codedamn staff
  • All exclusive courses unlocked
  • Unlimited hands-on practice
Try codedamn Pro (7-day free refund)