1. libraries
1.1. iostream
1.2. cmath
1.3. fstream
1.4. iomanip
1.5. string
1.6. sstring
2. Data structure
2.1. Advanced
2.1.1. Advanced Lists
2.1.2. Segment tree
2.2. Normal
2.2.1. arrays
2.2.1.1. one dimension
2.2.1.2. two dimension
2.2.1.2.1. misc
2.2.2. stacks
2.2.3. Binary tree
2.2.4. Heap
2.2.5. Graph
2.2.6. Hashing
2.2.7. Queues
2.2.8. linked lists
2.2.8.1. singly
2.2.8.2. circular
2.2.8.3. doubly
3. Operators
3.1. Arithmetic
3.1.1. + - * / %
3.2. Assignment
3.2.1. = += -= *= /= %=
3.3. Relational
3.3.1. == != > < >= <=
3.4. Logical
3.4.1. && || !
3.5. Bitwise
3.5.1. & | ^ ~ << >>
3.6. Other
3.6.1. sizeof
3.6.2. ?:
3.6.3. .
3.6.4. ->
4. Data types
4.1. bool
4.1.1. 0 or 1
4.2. void
4.3. for integer numbers
4.3.1. int
4.3.1.1. 4 bytes
4.3.2. short
4.3.2.1. 2 bytes
4.3.3. long
4.3.3.1. 4 bytes
4.3.4. long long
4.3.4.1. 8 bytes
4.4. for decimal numbers
4.4.1. float
4.4.1.1. 4 bytes
4.4.2. double
4.4.2.1. 8 bytes
4.5. for letters
4.5.1. for one letter
4.5.1.1. char
4.5.2. for two letters or more
4.5.2.1. string
5. Functions
5.1. standard library
5.1.1. main
5.2. user defined
6. Description
6.1. Applications
6.1.1. operating systems
6.1.2. Browsers
6.1.3. Libraries
6.1.4. Grafics
6.1.5. Banking applications
6.1.6. cloud systems
6.1.7. Databases
6.1.8. embedded systems
6.1.9. compilers
6.1.10. telephone switches
6.2. Pros
6.2.1. OOP language
6.2.2. simple
6.2.3. portable
6.2.4. popular
6.2.5. high level programming language
6.2.6. case sensitive
6.2.7. compiler based
6.2.8. DMA
6.2.9. fast
6.2.10. libraries existence
6.3. Cons
6.3.1. use of pointers
6.3.2. security issues
6.3.3. absence of garbage collector
6.3.4. absence of built in threads
6.4. Developer
6.4.1. Bjarne Stroustrup
7. Statements
7.1. Decision
7.1.1. if statement
7.1.2. switch
7.2. Repetition
7.2.1. Loop
7.2.1.1. for
7.2.1.2. while
7.2.1.3. do while