1 / 2

STRUCTURI DINAMICE DE DATE

STRUCTURI DINAMICE DE DATE. LISTE UNIDIRECŢIONALE excluderea unui element. MEMORIA. Segmentul de date. Heap ( grămada ). P. 010. 010. A. 020. R. 040. 050. 040. nil. 010. 020. 020. B. 030. 030. 050. V. 010. 010. 040. 030. 020. 040. 030. C. 040. 040. D. nil.

magee
Download Presentation

STRUCTURI DINAMICE DE DATE

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. STRUCTURI DINAMICE DE DATE LISTE UNIDIRECŢIONALE excluderea unui element

  2. MEMORIA Segmentul de date Heap (grămada) P 010 010 A 020 R 040 050 040 nil 010 020 020 B 030 030 050 V 010 010 040 030 020 040 030 C 040 040 D nil 050 F 030 060 070 080 090 100 Info Urm Procedure Exclud; var s:string; var s:string; var s:string; var s:string; begin readln(s); readln(s); R:=P; R:=P; V:=P; V:=P; while R<>nil do while R<>nil do while R<>nil do while R<>nil do while R<>nil do while R<>nil do while R<>nil do if R^.Info=s if R^.Info=s if R^.Info=s if R^.Info=s if R^.Info=s if R^.Info=s then then if P=R if P=R then 030 begin P:=P^.Urm; V:=P; dispose(R); R:=P; end; S F else else begin V^.Urm:=R^.Urm; V^.Urm:=R^.Urm; dispose(R); dispose(R); R:=V^.Urm; R:=V^.Urm; end else else else else else begin V:=R; V:=R; V:=R; V:=R; V:=R; R:=V^.Urm; R:=V^.Urm; R:=V^.Urm; R:=V^.Urm; R:=V^.Urm; end; end; end;

More Related