K-th Symbol in Grammar | Python Recursive Solution

Time Complexity: O(n log k), each recursive call divides the k by half
Space Complexity: O (n), the recursive stack goes through n levels

[gregoryrobertson]

This is a great explanation for the recursive solution. Thanks for posting the video. Out of curiosity, did you find the recursive solution easier or the iterative one using binary search? I just finished reviewing the Recursion I on Leetcode, and the relationship of k to the parent's k was not very obvious to me 😕