How to Find Largest Value in Each Tree Row/Level using BFS or DFS Algorithm?
You need to find the largest value in each row of a binary tree. Example: Input: 1 / \ 3 2 / \ \ 5 3 9 Output: This …
Tag: breadth first search
The Image Flood Fill Algorithm (C++)
An image is represented by a 2-D array of integers, each integer representing the pixel value of the image (from 0 to 65535). Given a coordinate (sr, sc) representing …
How to Compute Average of Levels in Binary Tree?
Given a binary tree, compute the average values for the nodes on each level and return them in the form of an array. For example: Input: 3 / \ …
Algorithms to Find Maximum Depth of N-ary Tree (C++)
Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf …
Break a Sentence into Words (Word Break Algorithms) – DFS, BFS and DP
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For example, given …