It will be supposed are materialised the following structures of data:
I) [STUCK] The manufacture [STUCK] should become with dynamic engagement of memory. It will be supposed are supported the operations: manufacture empty [STUCK], import in the top (push), deletion from the top (pop), reading of top, destruction [stoibas]. II) Tail of Priority The manufacture of tail should become with dynamic engagement of memory. It will be supposed are supported the operations: manufacture of empty pile minimal or biggest, import, deletion of top, reading of top, destruction.
III) Tree AVL The manufacture of tree will be supposed to become with dynamic engagement of memory. It will be supposed are supported the operations: manufacture of empty tree, import of element, deletion of element, search of element, postorder, inorder, preorder, destruction of tree.
IV) Breaking to pieces with Chains The user gives the size of table of breaking to pieces. It will be supposed are supported the operations: manufacture of empty table of breaking to pieces, import of element, deletion of element, search of element, destruction.
V) Directed [WRITER] with Weights The concretisation [WRITER] should become with dynamic engagement of memory. It will be supposed are supported the operations: manufacture empty [WRITER], import of top, import of acne, deletion of top, deletion of acne, finding of minimal paths, finding of minimal tree, crossing DFS, destruction.
ALL THESE GOT TO BE IN C++

Your post is really hard to read. I am assuming you used some fort of application to translate text written from some other language to English.
From what I can tell you are looking for someone to help you code for the following data structures:
1) STACK
2) MAX/MIN Heap or PQ
3) AVL Tree
4) Directed & Weighted Graph or Tree - I couldn't tell.
All use dynamic allocation & pretty much use standard operations.

No one is going to write code for you due to time requirements. My suggestion is to write some of the code and ask for help.