Please enable JavaScript.

Coggle requires JavaScript to display documents.

CHAPTER 5 : TREE, MEMBER - Coggle Diagram

- - - - Node to be deleted is leaf
      - Node to be deleted has only one child
      - Node to be deleted has two children
    - - In - Order Traversal
        
        Left --> root --> right
      - Pre - Order Traversal
        
        Root --> left --> right
      - Post - Order Traversal
        
        Left --> right --> root
- - - - Degree of tree - the highest degree of a node among all the nodes in a tree
  - - - Depth of tree is total number of edges from root to lead in the longest path
- - - - Every nodes can have 0 to 2 total children.
    - - Every nodes can have only 0 or 2 children.
    - - Every subtree have same amount of children.
    - - Obtain from prefect binary tree after deleting leaves of tree from left from right.
  - - - Operator appear between its operands.
        
        Example : a*b
    - - Binary operators before its operands.
        
        Example : *ab
    - - Binary operators comes after its operands.
        
        Example : ab*