Watch Demo

Rs. 699  Rs. 499

Byte-Sized-Chunks: Stacks, Queues, Binary Trees, Heaps

Build a strong foundation in algorithms by mastering it through the most effective technique of learning- visualization. In this course, you will learn Big-O notation and complexity, Stacks, Queues, Trees and Heaps.

05h:09m
Lifetime access
8 learners
Course Overview

Stack: Stack is a linear structure represented by a real physical stack or pile. It is a structure where insertion and removal of items takes place at an end called - top of the stack.

Queue: Queue is an abstract data structure, which is quite similar to stack. When compare to to Stack, queue is opened at both ends. One end is at all times used to insert data (enqueue) and the other is used to eliminate data (dequeue).

Binary tree: Binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. It is implemented mainly using Links.

Read more

Course Objectives

By the end of this course you will:

  • Design and implement software that use fundamental data structures
  • Visualise common data structures and the algorithms applied to them
  • Understand the trade-offs, complexity and use-cases for different types of container data structures

Prerequisites and Target Audience

Basic knowledge of programming is necessary. Knowledge in Java would be preferable.

This tutorial is designed for:

  • Computer Science and Engineering graduates who are looking to visualise data structures and internalise how they work
  • Experienced software engineers who want to brush-up on important fundamental concepts

Course Plan
Certificate of completion

1. Strong Fundamentals: Data Structures!
8 videos
You, This Course, and Us! 01:09

Meet The Stack - Simple But Powerful 15:40

Building A Stack Using Java 16:53

Match Parenthesis To Check A Well Formed Expression 11:21

Find The Minimum Element In A Stack In Constant Time 08:51

Meet The Queue - A Familiar Sight In Everyday Life 14:11

The Circular Queue - Tricky But Fast 19:44

Build A Queue With Two Stacks 17:30
3. Binary Search Trees
2 videos
The Binary Search Tree - an introduction 09:49

Insertion and Lookup in a Binary Search Tree 17:00
4. Binary Tree Problems
2 videos
Minimum Value, Maximum Depth and Mirror 11:46

Count Trees, Print Range and Is BST 14:38
5. Heaps
6 videos
The Heap Is Just The Best Way to Implement a Priority Queue 17:15

Meet The Binary Heap - It's A Tree At Heart 12:39

The Binary Heap - Making It Real With Code 17:13

The Binary Heap - Logically A Tree Really An Array 07:38

Heapify! 19:32

Insert And Remove From A Heap 16:34

Meet the Author


Loonycorn
4 Alumni of Stanford, IIM-A, IITs and Google, Microsoft, Flipkart

Loonycorn is a team of 4 people who graduated from reputed top universities. Janani Ravi, Vitthal Srinivasan, Swetha Kolalapudi and Navdeep Singh have spent years (decades, actually) working in the Tech sector across the world.

  • Janani: Graduated from Stanford and has worked for 7 years at Google (New York, Singapore). She also worked at Flipkart and Microsoft.
  • Vitthal: Studied at Stanford; worked at Google (Singapore), Flipkart, Credit Suisse, and INSEAD.
  • Swetha: An IIM Ahmedabad and IIT Madras alumnus having experience of working in Flipkart.
  • Navdeep: An IIT Guwahati alumnus and Longtime Flipkart employee.
  • More from Loonycorn
    Ratings and Reviews     5/5

    You may also like