Data Structure : Part1

            Set
            1. Union  - {1,2,3,4} - { 3,5,6} = {1,2,3,4,5,6}
            2. Intersection - {1,2,3,4} - {3,4,5,6} = {3,4}
            3. Set difference - { 1,2,3,4} - {3,4,5,6} = {1,2}
            4. Symmentic difference - { 1,2,3 } - { 2,3,4 } = {1,4}
        
            Tree
            1. Binary Tree
            2. AVL Tree
                1. Unbalance Tree
                2. Balance Tree
                3. Balance Insertion Tree
                4. Balance Deletion Tree
                5. AVL Tree Properties
                6. Tree Node Rotations  - Left Rotation and Right Notation
                7.