Teaching Kids Programming – Recursion in Five Minutes
Teaching Kids Programming: Videos on Data Structures and Algorithms The factorial function f(n) implemented in Python using Recursion: def f(n): if n == 1: return 1 return n * …
Category: recursive
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 …
Algorithms to Compute the Fibonacci String Sequence
Given strings s0, s1 and a positive integer n, return the nth term of the sequence A where: A = s0 A = s1 A = A + A …
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 / \ …