A Two-Level Binary Expression

1. A Two-Level Binary Expression treePtr ‘-’ ‘8’ ‘5’ INORDER TRAVERSAL: 8 - 5 has value 3 PREORDER TRAVERSAL: - 8 5 POSTORDER TRAVERSAL:8 5 -

2. Levels Indicate Precedence When a binary expression tree is used to represent an expression, the levels of the nodes in the tree indicate their relative precedence of evaluation. Operations at higher levels of the tree are evaluated later than those below them. The operation at the root is always the last operation performed.

3. ‘*’ ‘3’ ‘+’ ‘2’ ‘4’ A Binary Expression Tree What value does it have? ( 4 + 2 ) * 3 = 18 What infix, prefix, postfix expressions does it represent?

4. ‘/’ Inorder Traversal: (A + H) / (M - Y) Print second tree ‘-’ ‘+’ ‘A’ ‘H’ ‘M’ ‘Y’ Print left subtree first Print right subtree last

5. ‘/’ Preorder Traversal: / + A H - M Y Print first tree ‘-’ ‘+’ ‘A’ ‘H’ ‘M’ ‘Y’ Print left subtree second Print right subtree last

6. ‘/’ Postorder Traversal: A H + M Y - / Print last tree ‘-’ ‘+’ ‘A’ ‘H’ ‘M’ ‘Y’ Print left subtree first Print right subtree second

7. ‘/’ ‘3’ ‘+’ ‘2’ ‘4’ Evaluate: ‘*’ ‘-’ ‘5’ ‘8’ What infix, prefix, postfix expressions does it represent?

8. ‘*’ ‘/’ ‘-’ ‘8’ ‘5’ ‘3’ ‘+’ ‘2’ ‘4’ Answer Infix: ( ( 8 - 5 ) * ( ( 4 + 2 ) / 3 ) ) Prefix: * - 8 5 / + 4 2 3 Postfix: 8 5 - 4 2 + 3 / * has operators in order used

9. OPERATOR‘+’ OPERAND7 .whichType .operation .whichType .operand InfoNode has 2 forms enum OpType { OPERATOR, OPERAND } ; struct InfoNode { OpType whichType; union // ANONYMOUS union { char operation ; int operand ; } };

10. OPERAND7 .whichType .operand TreeNodes struct TreeNode { InfoNode info ;// Data member TreeNode* left ;// Pointer to left child TreeNode* right ; // Pointer to right child }; NULL6000 .left .info .right

11. ExprTree ‘*’ ~ExprTree ‘3’ ‘+’ Build Evaluate . . . ‘2’ ‘4’ class ExprTree private: root

12. int Eval ( TreeNode* ptr ) // Pre: ptr is a pointer to a binary expression tree. // Post: Function value = the value of the expression represented // by the binary tree pointed to by ptr. { switch ( ptr->info.whichType ) { case OPERAND : return ptr->info.operand ; case OPERATOR : switch ( tree->info.operation ) { case ‘+’ : return ( Eval ( ptr->left ) + Eval ( ptr->right ) ) ; case ‘-’ : return ( Eval ( ptr->left ) - Eval ( ptr->right ) ) ; case ‘*’ : return ( Eval ( ptr->left ) * Eval ( ptr->right ) ) ; case ‘/’ : return ( Eval ( ptr->left ) / Eval ( ptr->right ) ) ; } } } 12

13. A Full Binary Tree A full binary tree is a binary tree in which all the leaves are on the same level and every non leaf node has two children. SHAPE OF A FULL BINARY TREE

14. A Complete Binary Tree A complete binary tree is a binary tree that is either full or full through the next-to-last level, with the leaves on the last level as far to the left as possible. SHAPE OF A COMPLETE BINARY TREE

15. What is a Heap? A heap is a binary tree that satisfies these special SHAPE and ORDER properties: • Shape: a complete binary tree. • Order: the value stored in each node is greater than or equal to the value in each of its children.

16. treePtr 50 C 30 20 A T 10 18 Are These Both Heaps?

17. 70 Is This a Heap? tree 12 60 40 30 8 10

18. 70 Where is the Largest Element in a Heap? tree 12 60 40 30 8

19. 70 0 Number the Nodes Left to Right by Level tree 12 2 60 1 40 3 30 4 8 5

20. tree [ 0 ] [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] 70 60 12 40 30 8 70 0 12 2 60 1 40 3 30 4 8 5 Use the Numbers as Array Indexes to Store the Tree tree.nodes

21. // HEAP SPECIFICATION // Assumes ItemType is either a built-in simple data type // or a class with overloaded realtional operators. template< class ItemType > struct HeapType { void ReheapDown ( int root , int bottom ) ; void ReheapUp ( int root, int bottom ) ; ItemType* elements ; // ARRAY to be allocated dynamically int numElements ; }; 21

22. Observations • Heap is a struct with member functions • Why not a class? • To allow access to its components • Heaps are usually used in conjunction with other classes which want access to the components but will hide them from the application

23. Reheap Down • For heaps with all but the top element in heap position • How: • Swap root with left or right child • Reheap (down) with that child • Used to remove the highest element: • Remove the root • Put last element in root position • Reheap down to restore the order

24. Reheap Up • For a node that violates a heap up: swap with parent until it is a heap • So, if we added a node to the “end” of the tree, reheap up would put it in the right spot • To build a heap: • start with empty heap • add element to the end and reheap up

25. Exercises • Make a heap out of elements D H A K P R • Remove the top element and reheap.

26. ReheapDown // IMPLEMENTATION OF RECURSIVE HEAP MEMBER FUNCTIONS template< class ItemType > void HeapType<ItemType>::ReheapDown ( int root, int bottom ) // Pre: root is the index of the node that may violate the heap // order property // Post: Heap order property is restored between root and bottom { int maxChild ; int rightChild ; int leftChild ; leftChild = root * 2 + 1 ; rightChild = root * 2 + 2 ; 26

27. if ( leftChild <= bottom ) // ReheapDown continued { if ( leftChild == bottom ) maxChild = leftChild ; else { if (elements [ leftChild ] <= elements [ rightChild ] ) maxChild = rightChild ; else maxChild = leftChild ; } if ( elements [ root ] < elements [ maxChild ] ) { Swap ( elements [ root ] , elements [ maxChild ] ) ; ReheapDown ( maxChild, bottom ) ; } } } 27

28. // IMPLEMENTATION continued template< class ItemType > void HeapType<ItemType>::ReheapUp ( int root, int bottom ) // Pre: bottom is the index of the node that may violate the heap // order property. The order property is satisfied from root to // next-to-last node. // Post: Heap order property is restored between root and bottom { int parent ; if ( bottom > root ) { parent = ( bottom - 1 ) / 2; if ( elements [ parent ] < elements [ bottom ] ) { Swap ( elements [ parent ], elements [ bottom ] ) ; ReheapUp ( root, parent ) ; } } } 28

29. Priority Queue A priority queue is an ADT with the property that only the highest-priority element can be accessed at any time. Example: homework assignments are ordered by priority. Like a sorted list except for the access restriction. Goal: be able to insert in order and to access the top element efficiently.

30. ADT Priority Queue Operations Transformers • MakeEmpty • Enqueue • Dequeue Observers • IsEmpty • IsFull change state observe state 30

31. // CLASS PQTYPE DEFINITION AND MEMBER FUNCTIONS //---------------------------------------------------- template<class ItemType> class PQType { public: PQType( int ); ~PQType ( ); void MakeEmpty( ); bool IsEmpty() const; bool IsFull( ) const; void Enqueue( ItemType item ); void Dequeue( ItemType& item ); private: int numItems; HeapType<ItemType> items; int maxItems; }; 31

32. PQType ~PQType Enqueue Dequeue . . . class PQType<char> Private Data: numItems 3 maxItems 10 items .elements .numElements [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] ‘X’ ‘C’ ‘J’

33. Graphs A data structure that consists of a set of nodes (vertices) and arcs (edges) that relate the nodes to each other. G = (V, E) E.g. a map with V = cities and E = roads Undirected versus directed: some of the streets may be one-way. Weighted: each edge has a value (miles).

34. Applications Traversal: Find a route (path) from Boston to Chicago. Find the shortest path. Approaches: Depth-first search Breadth-first search 34

35. Implementation viaAdjacency Matrices • For a graph with N vertices: numVertices = the number of nodes vertices[N] = name of vertex N edges[N] [M] = weight from vertex N to M • See p. 554. • How do you add a vertex? An edge? • How do you find a path?

36. Implementation viaAdjacency Lists • An array of vertices. • Each vertex has a linked list of the nodes extending directly from it. • See p. 559. • When would you use this? When not?