BFS走訪: 層層樹(Trees on the level)
  • 1:33:24,
  • 1,608 views,
  • 2017-04-29,
  • 上傳者: 系統管理者,
  •  0
 
 
 
  • 1. Trees on the Level層層樹
  • 2. Observation 1: breath first search (BFS)
  • 3. Observation 2: is a binary tree completely specified
  • 4. Observation 2: input constraints
  • 5. Design Issue 1.1: node self-referential structure
  • 6. Design Issue 1.2: how to new a node
  • 7. Observation 3.1: root-to-node path
  • 8. Observation 3.2: root-to-node path
  • 9. Design Issue 2.1: build root-to-node path
  • 10. Design Issue 2.2: build root-to-node path
  • 11. Design Issue 2.1: build root-to-node path
  • 12. Observation 4: dump tree level by level
  • 13. Design Issue 3: dump tree level by level
  • 14. Design Issue 4: parsing trees node by node
  • 15. Coding Part 1: input tokens
  • 16. Coding Part 2: build tree
  • 17. Coding Part 3: dump tree
1/17
Volume
  • 速度 :
  • 畫質 :
  • 播放設定
00:00/1:33:24
00:00/01:28
 
 
    重點
    1.
    本題重點為Self Referential Structure
    可參考Self Referential Data Structure in C - create a singly linked list
    http://www.how2lab.com/programming/c/link-list1.php
    可參考Self Referential Data Structure in C - create an ordered singly linked list
    訪客如要回應,請先 登入
      解析度 : x
      資料夾 :
      標籤 :
      發表時間 :
      2017-04-29 12:43:00
      觀看數 :
      1,608
      長度 :
      1:33:24
      發表人 :
      系統管理者
      部門 :
      www
      QR Code :