you have a tree, return the longest path from root to a leaf. talked about time complexity. then another function that when you needed to use the first function. A little more complex
Anonymous
recursion with max
Check out your Company Bowl for anonymous work chats.