Here I share about my approaches that led me to clear interviews of top tier companies like Google off-campus, & get all the amazing opportunities. Get interview-ready with this course that has no prerequisites and is designed to make you an expert in solving easy to hard LeetCode problems with ease.
Curated by: Kunal Kushwaha (69 videos)
This is the second tutorial in the complete tree playlist of the DSA bootcamp for interview preparation: https://www.youtube.com/playlist?list=PL9gnSGHSqcnqfctdbCQKaw5oZ9Up2cmsq. In this video, we delve into AVL trees, which are a type of self-balancing binary tree, and a crucial data structure for coding interviews. You will learn about the inner workings and use cases of AVL trees and follow along as we implement them from scratch, backed by clear explanations and practical examples. Take part in the learning in public initiative! Share your learnings on LinkedIn and Twitter with #DSAwithKunal & don't forget to tag us! 👉 Resources - Join Replit: http://join.replit.com/kunal-kushwaha - AVL code: https://replit.com/@KunalsReplit/Trees-2-AVL - Complete Java DSA playlist: https://www.youtube.com/playlist?list=PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ - Code, Assignments, & Notes: https://github.com/kunal-kushwaha/DSA-Bootcamp-Java ➡️ Connect with me: http://kunalkushwaha.com ======================================================== Timestamps: 00:00:00 Introduction 00:03:15 Problem with BST 00:12:48 Self balancing binary trees 00:15:31 AVL trees theory + algorithm 00:34:36 Example walkthrough 00:40:57 Time complexity 00:42:22 Code 01:04:24 Closing remarks #trees #placements #dsa