Please enable JavaScript.

Coggle requires JavaScript to display documents.

trees (traversal methods (Inorder traversal (way to find traversal order,…

- - - - traverse top to down left to right
        
        note 2nd visit
  - - - traverse top to down left to right
        
        note 3st visit
  - - - traverse top to down left to right
        
        note 1st visit
    - - Space complexity
        
        O(n)
        
        Time complexity
        
        O(n)
        
        the 3 lines will be ordered in different order for 3 traversals
- - - - possible trees with n nodes
    - - possible trees with n nodes
        
        may get none or one or more than one tree
    - - possible trees with n nodes
        
        only one tree possible
- - - - not possible to draw; unless given that tree is full meaning all nodes have either 2 or no children
    - - in will give what is left to tree and what is right to tree; pre will give which one is root
    - - in will give what is left to tree and what is right to tree; post will give which one is root