'Summary: Dynamic data structures'

'\nIn programming languages ​​( dad, C, etc.), on that point is another appearance to allocate retentivity for selective information, which is called driving. In this case, the keeping for the pry ​​ depute at runtime. such values ​​ leave alone be called energetic. ingredient of RAM to be allocated to statically called static remembering, dynamic retention allocation of the section is called dynamic retentivity (heap memory).\n development dynamic variables gives the coder a morsel of additional features. First, touch the heap increases the account book of data being processed. Second, if the need for all data disappeared forwards the end of the program, the memory occupied by them can be freed for other information. Third, the exercise of dynamic memory allows you to create data structures of variable size.\n functional with dynamic values ​​associated with the use of more than than than one data type - the ext ension phone type. Variables with a wing type, called arrows.\nPointer contains the trade bowl in the dynamic memory that stores the value of a particular type. The pointer is located in static memory.\n yell values ​​- the payoff of the first byte of the line of merchandise memory where the value is located. Size field is uniquely stubborn by the type.\n attached we leave hash out in more detail pointers and actions with them in the language Pascal, examples will lead to Pascal and C.'