Summary: Dynamic data structures

\nIn programming languages ​​( papa, C, etc.), at that place is another itinerary to allocate computer stock for selective information, which is called high-power. In this case, the retentiveness for the set ​​ depute at runtime. much(prenominal) valuates ​​ leave alone be called participating. scratch of RAM to be allocated to statically called static shop, dynamic retrospection parcelling of the section is called dynamic memory (heap memory).\n utilize dynamic variables gives the coder a subprogram of additional features. First, associate the heap increases the wad of entropy being processed. Second, if the need for whatsoever data disappeared forward the end of the program, the memory occupied by them can be freed for other information. Third, the drug abuse of dynamic memory allows you to create data structures of variable size.\n operative with dynamic values ​​associated with the use of to a greater extent th an one data type - the university extension type. Variables with a character reference type, called cursors.\nPointer contains the get by playing area in the dynamic memory that stores the value of a particular type. The pointer is located in static memory.\n acknowledgment values ​​- the act of the first byte of the bailiwick memory where the value is located. Size field is uniquely persistent by the type.\n adjoining we testament contend in to a greater extent detail pointers and actions with them in the language Pascal, examples will lead to Pascal and C.