Alyce Brady CS 470: Data Structures CS 510: Computer Algorithms Post-order Traversal: Left Child - Right Child - Root Depth-First Search
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root
A BC DEFG HIJKLMNO
A BC DEFG HIJKLMNO
A BC DEFG HIJKLMNO H H
A BC DEFG HIJKLMNO H H
A BC DEFG HIJKLMNO H H
A BC DEFG HIJKLMNO H I
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L M
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L M
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L M F
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L M F
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L M F
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L M F
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L M F N
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L M F N
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L M F N
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L M F N O
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L M F N O
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L M F N O G
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L M F N O G
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L M F N O G C
A BC DEFG HIJKLMNO Post-order Traversal: Left Child - Right Child - Root H I D J K E B L M F N O G C
Post-order Traversal: Left Child - Right Child - Root A BC DEFG HIJKLMNO H I D J K E B L M F N O G C A
Post-order Traversal: Left Child - Right Child - Root A BC DEFG HIJKLMNO H I D J K E B L M F N O G C A
Pseudo-Code for Post-order Traversal post-traverse post-traverse left subtree post-traverse right subtree visit current node e.g., print value
Time and Space Complexity for Depth-First Search Algs. Time Complexity Time Complexity –Visit each node three timesO(n) first arrival first arrival return from left child return from left child return from right child return from right child
Space Complexity Space Complexity –Stack to handle recursion Stack length = depth of tree Stack length = depth of tree best case: lg n best case: lg n worst case: n O(n) worst case: n O(n) Time and Space Complexity for Depth-First Search Algs.