Category: BFS
Given a binary tree root, find the value of the deepest node. If there’s more than one deepest node, then return the leftmost one. Constraints n ≤ 100,000 where …
Given a binary tree root, return whether all leaves are at the same level. Constraints n ≤ 100,000 where n is the number of nodes in root Breadth First …
You are given a binary tree root containing unique values, and an integer target. Find the node with value target and return the node that’s directly right of it …
Teaching Kids Programming: Videos on Data Structures and Algorithms Introduction to Data Structure Double-Ended Queue So far, we have learned the Queue (First In First Out) and Priority Queue …
You are given a set of two-dimensional rectangular boxes on a two-dimensional Cartesian plane with the following assumptions and constraints: All boxes are axis-aligned, i.e. each box can be …