Find the Length of the Collatz Sequence
Given a positve integer n, find the length of its Collatz sequence. The Collatz sequence is generated sequentially where: n = n / 2 if n is even n …
Tag: recursion
Teaching Kids Programming – Computing Fibonacci Numbers using 3 Methods
November 23, 2020
algorithms, dynamic programming, python, recursive, teaching kids programming, youtube video
No Comments
Teaching Kids Programming: Videos on Data Structures and Algorithms Mathematically, the Fibonacci Numbers are: Fibonacci Number – Recursion def f(n): if n == 0: return 0 if n == …
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 * …
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 (Preorder Traversal) to Compute the Kth Smallest in a Binary Search Tree
Given a binary search tree root, and k return the kth (0-indexed) smallest value in root. It is guaranteed that the tree has at least k + 1 nodes. …