Algorithms and Data Structures

Transcription

1 Algorithms and Data Structures Part 2: Data Structures PD Dr. rer. nat. habil. Ralf-Peter Mundani Computation in Engineering (CiE) Summer Term 2016

2 Overview general linked lists stacks queues trees 2 2

3 General fundamentals data structure way of organising data for processing by some algorithm or more general by some computer program often the choice of proper data structures is the only major decision for implementations for the same information some data structures require more or less space for storing the information for the same operations (on the data) some data structures lead to more or less efficient algorithms hence, the choice of algorithms and data structures is closely intertwined design of algorithms also means design of sufficient data structures 2 3

4 Overview general linked lists stacks queues trees 2 4

5 Linked Lists fundamentals elementary data type, but not (yet) defined as primitive in all languages advantages compared to arrays easy growth and shrinkage in size over lifetime, hence, maximum size must not be known in advance high flexibility w.r.t. rearrangement of data items (nevertheless, this comes up with higher expenses for the access of arbitrary items) general description set of sequentially organised items, so called nodes explicit organisation of nodes via link to next node N 1 N 2 N 3 N M 1 N M linked list with nodes N i, 1 i M 2 5

6 Linked Lists fundamentals (cont d) each node contains one container for storing data item value (integer, float, boolean, ) one container for storing link to next node value i 1 value i value i 1 problem: what to specify as next node in case of last node hence, dummy node NIL to indicate end of list for reasons of convenience also dummy node HEAD at the other end HEAD N 1 N 2 N M 1 N M NIL linked list with nodes N i, 1 i M 2 6

7 Linked Lists fundamentals (cont d) assume, there s a primitive list with two containers value and link which can be accessed via list value and list link furthermore, a dummy node NIL should also be provided hence, the following program creates an empty list list L L link NIL which only consists of the two dummy nodes HEAD and NIL HEAD NIL for adding nodes to list L some further understanding is necessary 2 7

8 Linked Lists fundamentals (cont d) linked lists are dynamic structures easy rearrangement of nodes possible (just changing links instead of moving items in case of arrays) example: last node should be moved to the front (3 links to be changed) HEAD NIL HEAD NIL HEAD NIL 2 8

9 Linked Lists list operations typical operations on linked lists are insertion of new nodes (which makes it grow by one in length each) deletion of old nodes (which makes it shrink by one in length each) for inserting a new node only two links have to be changed 4 HEAD NIL 4 HEAD NIL 2 9

10 Linked Lists list operations (cont d) the following procedure appends a new node at the end of list L by recursively processing all nodes starting from HEAD procedure APPEND (L, new_node) if L link NIL then new_node link L link L link new_node else APPEND (L link, new_node) fi end changing the condition allows to insert a new node anywhere in the list 2 10

11 Linked Lists list operations (cont d) the following procedure inserts a new node before the one with value val procedure INSERT (L, new_node, val) case L link NIL: exit L link value val: new_node link L link L link new_node else INSERT (L link, new_node, val) esac end the first test for NIL is necessary in case there is no node with value val and the recursion reaches the end of list L 2 11

12 Linked Lists list operations (cont d) when deleting node N i from a list only one link has to be moved (i. e. linking from node N i 1 to node N i 1 ) this does not delete node N i itself (which still points to N i 1 ), but it is no longer accessible by following the links from HEAD HEAD NIL HEAD NIL 2 12

13 Linked Lists list operations (cont d) the following procedure deletes a node (with value val) from lists L procedure DELETE (L, next, val) case next NIL: exit next value val: L link next link else DELETE (L link, next link, val) esac end the temporary node next is necessary to link from N i 1 to N i 1 (again, the dummy element HEAD makes everything more convenient) for deleting some node from list L the procedure is called with parameters DELETE (L, L link, val) 2 13

14 Linked Lists doubly linked lists as shown, linked lists are very efficient for certain operations, but there is no direct access to single nodes hence, finding the kth item has a complexity of (N) as all nodes have to be processed successively until the kth item is reached (compared to (1) for arrays) furthermore, there is no possibility of going backwards in case a node that has already been processed is needed (such as N i 1 for deleting N i ) idea: maintain two links for each node, one to the item before and one to the item after so called doubly linked lists HEAD NIL N 1 N 2 N M 1 N M NIL doubly linked list with nodes N i, 1 i M TAIL 2 14

15 Overview general linked lists stacks queues trees 2 15

16 Stacks fundamentals for many applications rather hard restrictions concerning the accessibility of data structures can be made in order to hide (often complicated and, thus, error prone) implementation details such as links or indices allow more flexible implementations with fewer operations famous representatives of such restricted-access data structures are so called stacks or pushdown stacks, i.e. one-dimensional structures with LIFO (last in, first out) ordering that support two types of basic operations push (val): inserting one element with value val at the beginning of the stack pop: removing one element from the beginning of the stack and returning its value 2 16

17 Stacks fundamentals (cont d) stacks are, for instance, frequently used for evaluating arithmetic expressions (within pocket calculators, e.g.) arithmetic expressions can be written in different notations prefix: operands appear after the operator infix: the customary way of writing arithmetic expressions (but parentheses may be required) postfix or reverse Polish: operands appear before the operator therefore, stacks require arithmetic expressions to appear in postfix notation so the operands can be on the stack when the operator is encountered (as expression are processed from left to right) and, thus, intermediate results can again be pushed to the stack 2 17

18 Stacks implementation of stacks stacks to be implemented, for instance, as arrays (in case the maximum size can be predicted in advance) linked lists assume, there s a primitive stack (of fixed size N) implemented as array further assumptions and requirements are necessary it s not possible to push an element on a full stack it s not possible to pop an element from an empty stack index last indicates the last element in a stack stack of size N 10 with last 4 hence, operations push and pop ready to be implemented 2 18

19 Stacks implementation of stacks (cont d) push: variables N and last with global visibility procedure PUSH (S, val) if last N 1 then last last 1 S(last) val fi end where S indicates a stack and val the value to be pushed on the stack 2 19

20 Stacks implementation of stacks (cont d) pop: variables N and last with global visibility procedure POP (S) tmp 0 if last 0 then tmp S(last) last last 1 return (tmp) else return (false) fi end where S indicates a stack 2 20

21 Stacks example evaluation of an arithmetic expression A B C (D E) using a stack stack S push (S, B) push (S, C) push (S, D) push (S, E) push (S, pop (S) pop (S)) push (S, pop (S) pop (S)) push (S, pop (S) pop (S)) A pop (S) E D C B operators and have to switch operands due to LIFO ordering 2 21

22 Overview general linked lists stacks queues trees 2 22

23 Queues fundamentals other representatives of restricted-access data structures are queues one-dimensional structures with FIFO (first in, first out) ordering that support two types of basic operations insert (val): inserting one element with value val at the beginning of the queue remove: removing one element from the end of the queue and returning its value in comparison to stacks, the order of processing reflects the order of arrival of elements (also referred to as first come, first serve) queues to be implemented, for instance, as arrays (in case the maximum size can be predicted in advance) linked lists 2 23

24 Queues implementation of queues assume, there s a primitive queue (of fixed size N) implemented as array further assumptions and requirements are necessary it s not possible to insert an element into a full queue it s not possible to remove an element from an empty queue variable used indicates the amount of already used cells two indices first and last indicate the first and the last element in a queue, taking into account the wraparound back to 0 when the end of the array is encountered queue of size N 10 with used 5, first 7, and last 1 hence, operations insert and remove ready to be implemented 2 24

25 Queues implementation of queues (cont d) insert: variables N, used, first, and last with global visibility procedure INSERT (Q, val) if used N then last last 1 if last N then last 0 fi Q(last) val used used 1 fi end where Q indicates a queue and val the value to be inserted into the queue 2 25

26 Queues implementation of queues (cont d) remove: variables N, used, first, and last with global visibility procedure REMOVE (Q) tmp 0 if used 0 then tmp Q(first) used used 1 first first 1 if first N then first 0 fi return (tmp) else return (false) fi end 2 26

27 Overview general linked lists stacks queues trees 2 27

28 Trees fundamentals definition: a tree is a finite set of nodes such that 1) there is one specially designated node called root 2) remaining nodes are partitioned into N 0 disjoint sets T 1,, T N where each of these sets is a tree (so called subtree of the root) 3) there exists exactly one path between the root and each of the other nodes in the tree root links between nodes might point downwards (away from the root) or upwards (towards the root) depending upon the application 2 28

29 Trees fundamentals (cont d) further definitions (1) each node (except the root) has exactly one node above it which is called its parent hence, the nodes directly below a node are called its children nodes with no children are called leaves or terminal nodes hence, nodes with children are called internal or nonterminal nodes parent children internal nodes leaves 2 29

30 Trees fundamentals (cont d) further definitions (2) children of the same parent are said to be siblings a forest is a set of N 0 disjoint trees (removing the root of a tree leads to a forest) the level of a node is defined by initially letting the root be at level one; hence, if a node is at level K, then its children are at level K 1 the height or depth of a tree is the maximum level of any node in the tree level 1 siblings level 2 level

31 Trees representation of trees idea: using linked lists where one node in the list corresponds to one node in the tree problem: nodes can have a varying number of links difficult to write algorithms for data structures with varying sizes hence, already known list elements to be extended by one additional link as follows value siblings children 2 31

32 Trees representation of trees (cont d) example A B E G HEAD A C D F H I J B E G C D F H I J i. e. link pointing to NIL 2 32

33 Trees binary trees definition: a binary tree is a finite set of nodes which is either empty or consists of a root node and two disjoint binary trees called the left and right subtree hence, any node can have at most two children ( name binary tree ) examples of binary trees skewed binary tree binary tree full binary tree 2 33

34 Trees binary trees (cont d) properties a tree with N nodes has N 1 edges (i. e. links); this is true for all kind of trees and follows directly from the recursive definition the maximum number of nodes N in a full binary tree of depth K 0 is 2 K 1 the height of a full binary tree with N nodes is about ld N (log 2 N) for representing binary trees, linked lists can be used again (labelling one link as left and one link as right) value left right drawback: determination of a node s parent due to missing upward link 2 34

35 Trees binary trees (cont d) example HEAD A B F C G A D E B F C G D E i. e. link pointing to NIL 2 35

36 Trees binary trees (cont d) adding a node to a binary tree is a quite simple task 1) find a corresponding node X with at least one free link left or right 2) link from X to the new node Y, thus, X becomes parent of Y Y X X Y 2 36

37 Trees binary trees (cont d) deleting a node from a binary tree is a more complex task to be distinguished a) deleting a leaf node b) deleting an internal node with one child c) deleting an internal node with two children cases a) and b) are quite easy to process, but case c) requires further understanding case a) case b) case c) 2 37

38 Trees binary trees (cont d) case a: deleting a leaf node 1) find the corresponding parent of the leaf node to be deleted 2) set the parent s link to NIL node to be deleted 2 38

39 Trees binary trees (cont d) case b: deleting an internal node with one child 1) find the corresponding parent of the node to be deleted 2) set the parent s link to the child of the node to be deleted node to be deleted 2 39

40 Trees binary trees (cont d) case c: deleting an internal node with two children 1) find the corresponding parent of the node to be deleted 2) find the right-most child (X) from the node to be deleted its left child 3) set the parent s link to the left child of the node to be deleted 4) set X s right link to the right child of the node to be deleted node to be deleted right-most child X 2 40