Depth First Search Algorithm to Delete Even Leaves from Binary Tree
Given a binary tree root, repeatedly delete all leaves that have even values. That is, if after deletions, a node becomes a leaf with an even value, it too …
Tag: C++ recursion
Algorithms to Check if a String is a Subsequence String of Another String
Given two strings s1 and s2, determine if s1 is a subsequence of s2. A string a is a subsequence of another string b if you can delete some …
Recursive Depth First Search Algorithm to Diagonal Tree Traversal
Given a binary tree root, return the sum of each of the diagonals in the tree starting from the top to bottom right. For example, given 1 / \ …
Depth First Search Algorithm to Find the Strobogrammatic Number of Given Length
A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down). Find all strobogrammatic numbers that are of length = n. Example: …
Depth First Search Algoritm to Compute The k-th Lexicographical String of All Happy Strings of Length n
A happy string is a string that: consists only of letters of the set . s != s for all values of i from 1 to s.length – 1 …
