Please enable JavaScript.

Coggle requires JavaScript to display documents.

Math (Final) - Coggle Diagram

- - - - cycle
        closed path
  - - - NOTE ON DRAWING:
        
        write the 1 node in stack DFS(1)
        stack: 1, ..... but this is consider unvisit!
        
        last visit: write tick/dot
        
        last visit: don't add to stack
        
        when go back to previous,
        AND need to go to next unvisit add that to stack
        result: go to the deepest, start a path
        when come back, visit remaining path
        in between, than keep going back to the first
    - - Pre-order
        write root,
        go to left write,
        go to right, write
        go to unvisit
        見乜寫乜
      - in-order
        vist most left, write
        revisit root, write
        visit right, then most left again....
      - some-order
        go to deepest left, write
        go to right, revisit left (write all things again)
        write the root
        (must need graph and cancel LRL to help)
      - Post-order
        visit most L,
        visit most R,
        no choice, write
- - - - weight
        1(1) +... 4(3) + 5(3)
        
        huffsman
        
        sort weight and freq
        A5 N4 D2 ...
        
        lower bound / entropy
        
        expected no. of bits.char
        sum( normalized freq x weight)
        
        for 2 char, E = E0/2