Balanced Binary Tree | Minimum Depth of a Binary Tree | LeetCode Java | Geekific
Discord Community: / discord
GitHub Repository: https://github.com/geekific-official/
In our tree series, we discussed and implemented binary trees in depth. We also explained the difference between BSTs, AVL trees, Red-Black trees, and many other tree types. The reason I am telling you this is because this video revolves around one particular property that helped us distinguish between these tree types, and it is whether a tree is balanced or not. So, today we will attempt to determine if a given binary tree is balanced or not, and attempt to calculate the minimum depth of a given binary tree.
LeetCode Problems solved in this video:
https://leetcode.com/problems/balance...
https://leetcode.com/problems/minimum...
Timestamps:
00:00 Introduction
00:20 Determining if a Binary Tree is Balanced
02:42 Retrieving the Minimum Depth of a Binary Tree
04:40 Thanks for Watching!
If you found this video helpful, check other Geekific uploads:
Object-Oriented Programming Fundamentals: • What is Object-Oriented Programming? | Obj...
SOLID Principles and Best Practices: • SOLID Design Principles with Java Examples...
Recursion Made Simple, Recursive Methods: • What is Recursion? | Recursion Made Simple...
Use-Case and Sequence Diagrams: • UML Use-Case and Sequence Diagrams Made Si...
Introduction to Dynamic Programming: • What Is Dynamic Programming and How To Use...
What is the Two-Pointers Technique and how to use it?: • What is the Two-Pointers Technique & How t...
Trees Compared and Visualized, BST vs AVL vs RedBlack vs Splay vs Heaps: • Trees Compared and Visualized | BST vs AVL...
Generics and Wildcards in Java, Invariance vs Covariance vs Contravariance: • Generics and Wildcards in Java | Part 2 | ...
Two Sum Problem, from Brute Force to Optimal: • Two Sum Problem | From Brute Force to Opti...
What is a Thread? (Process, Program, Parallelism, Scheduler Explained): • What is a Thread? | Threads, Process, Prog...
Domain-Driven Design Made Simple: • Domain-Driven Design Made Simple | What is...
#Geekific #BinaryTree #MinimumDepth #CodingInteview #LeetCode #Java #Google #Amazon #Meta #Microsoft #Apple #Netflix
On this page of the site you can watch the video online Balanced Binary Tree | Minimum Depth of a Binary Tree | LeetCode Java | Geekific with a duration of hours minute second in good quality, which was uploaded by the user Geekific 24 June 2023, share the link with friends and acquaintances, this video has already been watched 855 times on youtube and it was liked by 27 viewers. Enjoy your viewing!
