| Title | Tree traversal. |
| Catalog Type | SLCItem |
| Persistent ID | https://adapt2.sis.pitt.edu/pcex/index.html?lang=PYTHON&set=py_trees_traversal |
| Platform Name | PCEX |
| Features | — |
| Description | The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order traversal, pre-order traversal and post-order traversal. In-order traversal visits the nodes from the left, the root node and the right Pre-order traversal visits the nodes from the root node, the left and the right Post-order traversal visits the nodes from the left, the right and the root node. In this example, we construct an in-order traversal algorithm. |
| Keywords | binary search, trees |
| Author | Kamil Akhuseyinoglu |
| Institution | University of Pittsburgh |
| Iframe URL | https://adapt2.sis.pitt.edu/pcex/index.html?lang=PYTHON&set=py_trees_traversal |
| Protocol | PITT, HTML |
| Protocol URL | |
| License | MIT |
| Programming Language | Python |
| Natural Language | en |