Skip to Content
Python Data Structures and Algorithms
book

Python Data Structures and Algorithms

by Benjamin Baka
May 2017
Intermediate to advanced
310 pages
8h 5m
English
Packt Publishing
Content preview from Python Data Structures and Algorithms

Post-order traversal and postfix notation.

Postfix or reverse Polish notation (RPN) places the operator after its operands, as in 3 4 +. As is the case with Polish notation, there is never any confusion over the precedence of operators, so parentheses are never needed: 4 5 + 5 3 - *.

In this mode of traversal, you would visit the left sub-tree, the right sub-tree, and lastly the root node.

The post-order method is as follows:

    def postorder(self, root_node):         current = root_node         if current is None:             return         self.postorder(current.left_child)         self.postorder(current.right_child)         print(current.data)
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Data Structures and Algorithms in Python

Data Structures and Algorithms in Python

Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser
Hands-On Data Structures and Algorithms with Python - Second Edition

Hands-On Data Structures and Algorithms with Python - Second Edition

Dr. Basant Agarwal, Benjamin Baka, David Julian
Data Structures & Algorithms in Python

Data Structures & Algorithms in Python

John Canning, Alan Broder, Robert Lafore

Publisher Resources

ISBN: 9781786467355Supplemental Content