第337天 教娃编程 - 求多叉树的最大深度(递归式深度优先和广度优先算法

--->List of All Tutorial Videos<---

Post: Day 337 - Teaching Kids Programming - Maximum Depth of N-ary Tree via DFS and BFS Algorithm

• B 站: https://www.bilibili.com/video/BV16Q4y1v7zq/
• 目录: https://zhihua-lai.com/teaching/ch/
• List of Videos: https://zhihua-lai.com/teaching/

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Thank you for reading ^^^^^^^^^^^^^^^

NEW! Following my Trail (Upvote or/and Downvote)

Follow me for topics of Algorithms, Blockchain and Cloud.
I am @justyy - a Steem Witness
https://steemyy.com

My contributions

• Video Downloader
• Steem Blockchain Tools
• Free Cryptos API
• VPS Database
• Computing Technology Blog
• A few useless tools
• And some other online software/tools
• Merge Files/Videos
• LOGO Turtle Programming Chrome Extension
• Teaching Kids Programming - Youtube Channel and All Contents

Delegation Service

Voting Power Considered in Voting Schema and Important Update of Delegation Service!

• Delegate 1000 to justyy: Link
• Delegate 5000 to justyy: Link
• Delegate 10000 to justyy: Link

Support me

If you like my work, please:

• Buy Me a Coffee, Thanks!
• Become my Sponsor, Thanks!
• Voting for me:
  https://steemit.com/~witnesses type in justyy and click VOTE
  

1. Delegate SP: https://steemyy.com/sp-delegate-form/?delegatee=justyy
2. Vote @justyy as Witness: https://steemyy.com/witness-voting/?witness=justyy&action=approve
3. Set @justyy as Proxy: https://steemyy.com/witness-voting/?witness=justyy&action=proxy
   Alternatively, you can vote witness or set proxy here: https://steemit.com/~witnesses

---