Breadth First Search Algorithm to Compute the Max Width of a Binary Tree
Given a binary tree root, return the maximum width of any level in the tree. The width of a level is the number of nodes that can fit between …
Tag: binary tree
Counting Maximal Value Roots in Binary Tree using Depth First Search Algorithm
Given a binary tree root, count and return the number of nodes where its value is greater than or equal to the values of all of its descendants. For …
Depth First Search Algorithm to Find the Largest Difference Between Node and a Descendant in a Binary Tree
Given a binary tree root, return the largest absolute difference between any node and its descendants. For example, given the following tree: 0 / \ 4 2 / \ …
DFS and BFS Algorithms to Find All the Lonely Nodes of a Binary Tree
In a binary tree, a lonely node is a node that is the only child of its parent node. The root of the tree is not lonely because it …
Depth First Search Algorithm to Compute the Smallest String Starting From Leaf
Given the root of a binary tree, each node has a value from 0 to 25 representing the letters ‘a’ to ‘z’: a value of 0 represents ‘a’, a …