Title

第25講 Trees

第1節

L25A

第2節

L25B

第3節

L25C

第4節

L25D

Syllabus

章節大綱

L25A
       00:00 Review of tree traversals
       00:50 Example of application
       06:15 Polish notation
       16:50 Definition of spanning trees



L25B
       00:00 Example of a spanning tree
       03:30 DFS (Depth-First Search) algorithm
       12:50 BFS (Breadth-First Search) algorithm


L25C
       00:00 Example of DFS and BFS
       13:35 Paul Erdos


L25D
       00:00 Example of trees and sorting (Merge Sort )