ITEC2620 Introduction to Data Structures

Transcription

1 9//201 T2620 ntroduction to ata Structures Lecture b nserting and eleting into Linked ata Structures nserting into Linked Lists nsert an element into a linked sorted from smallest to largest.g..insert(newvalue) Use two pointers nserting into Linked Lists nserting into Linked Lists f new value is smallest, or if is empty Must update 1 newvalue 3 1

2 9//201 nserting into Linked Lists V nserting into Linked Lists V 1 When is larger or null.next becomes newvalue newvalue.next becomes newvalue 3 nserting into Linked Lists V nserting into Linked Lists V 1 1 newvalue 9 newvalue 9 2

3 9//201 nserting into Linked Lists V nserting into Linked Lists X 1 1 newvalue 9 newvalue 1 nserting into Linked Lists X nserting into Linked Lists X 1 1 newvalue 1 newvalue 1 3

4 9//201 nserting into Linked Lists X nserting into Linked Lists X 1 1 newvalue 1 newvalue 1 nserting into Linked Lists XV eleting from Linked Lists elete an element into a linked sorted from smallest to largest 1.g..delete() Use two pointers toelete newvalue 1 4

5 9//201 eleting from Linked Lists eleting from Linked Lists f deleted value is smallest (first link) Must update 1 eleting from Linked Lists V eleting from Linked Lists V When toelete.key is value.next becomes toelete.next 1

6 9//201 eleting from Linked Lists V eleting from Linked Lists V 1 1 toelete toelete eleting from Linked Lists V eleting from Linked Lists X 1 1 toelete toelete 1 6

7 9//201 eleting from Linked Lists X eleting from Linked Lists X 1 1 toelete toelete 1 1 eleting from Linked Lists X eleting from Linked Lists X 1 1 toelete toelete 1 1

8 9//201 nserting into a ST nsertion always happens at the bottom of the tree New node will be a leaf node Put the node where you would look for it! nserting into a ST nsert 2 nserting into a ST nserting into a ST V

9 9//201 eleting from a ST eleting from a ST asy case Target node has 0 or 1 child node(s) Link past it (or to null) like a linked ard ase Target node has 2 child node(s) Replace node with largest on left elete eleting from a ST eleting from a ST V Node right child is now null elete 9

10 9//201 eleting from a ST V eleting from a ST V Node left child is now null elete eleting from a ST V eleting from a ST V Node left child now points to node elete

11 9//201 eleting from a ST X eleting from a ST X Node left child now points to node elete eleting from a ST X Previous node points to the largest value on the left subtree of deleted node.<side> becomes maxvalue largest on left maxparent.right becomes maxvalue.left maxvalue.left becomes toelete.left maxvalue.right becomes toelete.right eleting from a ST X maxparent elete maxvalue toelete 11

12 9//201 eleting from a ST X eleting from a ST XV maxparent toelete maxvalue maxparent toelete maxparent.right = maxvalue.left maxvalue.<side> = maxvalue eleting from a ST XV eleting from a ST XV maxvalue maxparent toelete maxvalue.left = toelete.left maxvalue.right = toelete.right

13 9//201 eleting from a ST XV Readings and ssignments Suggested Readings from Shaffer (third edition).4 13