Minimum Depth of Binary Tree - Search in a Sorted Array of Unknown Size Oct 22 LeetCoding Challenge

22nd Oct LeetCoding Challenge - GoMaster Coding Interviews
Problem 1: Minimum Depth of Binary Tree
O(n) BFS approach

Problem 2: Search in a Sorted Array of Unknown Size
O(logn) Binary Search approach

Solution by: Channa Bankapur
Trainer at GoMaster Technologies http://gomaster.in

Видео Minimum Depth of Binary Tree - Search in a Sorted Array of Unknown Size Oct 22 LeetCoding Challenge канала GoMaster Coding Interviews