Teaching Kids Programming – Maximum Depth of N-ary Tree via Depth First Search or Breadth First Search Algorithms
November 21, 2021
algorithms, BFS, DFS, python, teaching kids programming, youtube video
No Comments
Teaching Kids Programming: Videos on Data Structures and Algorithms Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path …