Working Professional | Computer Science Engineer | Developer | Programmer | Cleared GATE Examination

Jaspreet Kaur

This course describes about Binary Search Trees BST, its different operations, insertion, delection, searching. It also describes one of the most used BST, red Black Trees, its different operations and height bounds.

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE - Iconic Pro

English

Binary Search Trees: GATE

Greedy Techniques

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

This contains the overview of all the lessons of the course, the target audience and course objectives,.

Overview

This lesson describes about the insert operation in BST and its implementation

Insertion in BST

This lesson describes about the search operation in BST and its different approaches.

Searching in BST

This lesson desribes about the Binary Search Trees, how to construct them, its time complexity and its different types.

What is BST?

This lesson describes about the deletion operation in BST. It includes all the three cases of deletion with example.

Deletion in BST

This lesson describes the red black trees, its properties and why we use red black trees.

Red Black Trees

This lesson describes the insertion operation in RB Trees with the help of an example.

Insertion in RB Trees

This lesson describes the deletion operation in RB trees ,considering its different cases for deletion.

Deletion in RB Trees

This lesson proves the height bound of RB Trees as O(log n)

Height of RB Trees

This lessons consists of some practice on binary search trees. It also includes previous year GATE questions.

Practise Questions on BST - 1

This lesson contains some questions on binary search trees and red black trees.

Practice Questions on BST - 2

Code HELLOSONU01 | 8+ Years Teaching Exp. in GATE CS IT & GATE DS AI on Unacademy | Mentored 2 Lakh+ Students | Produced Rankers Under 500

Sweta Kumari

This course will discuss Graph Algorithms in detail with concepts first and then previous year questions on this topic. So, this is a complete course in Graph Algorithms that have a Weightage of 2 marks.

(Hindi) Graph Algorithms Concepts and PYQs : GATE (CS/IT)

This course will cover Shortest Path Algorithms like Djikstra, Bellman-Ford and Floyd Warshall Algorithm. The course will be beneficial for GATE Aspirants.

(Hindi) Shortest Path Algorithms Practice Questions: GATE (CS and IT)

This course will cover Algorithm Designing Approaches With Problems and thier Solutions.

(Hindi) Greedy Algorithm Designing Approaches - GATE (CS & IT)

(i) Gate Qualified 2016
(ii) Mtech (Cyber Security) from NIT Kurukshetra.
(iii) UGC-Net Qualified 
(iv) Cyber security analyst at Honeywell

Sourav Newatia

Divide and conquer is an algorithm design paradigm based on multi-branched recursion. In this course, the educator will cover all the D & C methods like linear search, Binary search, Merge sort, Quick sort, Matrix multiplication, Integer multiplication, Min-Max Algorithm, set Algorithms, Tree representation, Priority Queue, and Heap.

Divide and Conquer Methods: GATE (CS and IT)

 Btech in CSE and  Mtech in Intelligent Systems and Robotics . GATE Qualified. Currently working as an associate Software Developer at Globa

Akansha Aggarwal

This course discusses searching algorithms and hashing and its different collision resolution techniques with previous year gate questions

Searching and Hashing for GATE

This course will cover Searching Algorithms Like Linear , Binary & Interpolation Search for  GATE CS/IT.

Lessons

11 lessons • 1h 30m

Invalid Date

NaN

Overview

Invalid Date

NaN

Insertion in BST

Invalid Date

NaN

Searching in BST

Invalid Date

NaN

What is BST?

Invalid Date

NaN

Deletion in BST

Invalid Date

NaN

Red Black Trees

Invalid Date

NaN

Insertion in RB Trees

Invalid Date

NaN

Deletion in RB Trees

Invalid Date

NaN

Height of RB Trees

Invalid Date

NaN

Practise Questions on BST - 1

+ See all lessons