Showing 0–0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Preorder Traversal Exercise | Tracing Exercise | Practice exercise for preorder traversal. User clicks on nodes to indicate the proper order of the traversal process. | OpenDSA | Preorder Traversal |
| 2 | Preorder Traversal Shown in Detail | Algorithm Visualization, Code Tracing Presentation | Slideshow presenting a detailed visualization of preorder traversal of a binary tree and how the recursion works. | OpenDSA | Preorder Traversal |
| 3 | Tree preorder traversal | Python PredictingFinalResult for demonstrating Tree preorder traversal | QuizPET | binary search, trees | |
| 4 | Construct a preorder traversal function | Construct a preorder traversal function that recursively traverse a tree from root node, left node and right node. We store... | jsParsons | trees | |
| 5 | General Tree Preorder Traversal Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow showing preorder traveral of a general tree, and demonstrates the general tree ADT. | OpenDSA | General Tree |
| 6 | Typical Mistakes During Tree Traversal | Code Tracing Presentation | Slideshow demonstrating some typical mistakes when writing recursive binary tree traversals. | OpenDSA | Preorder Traversal |
| 7 | Tree traversal. | The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order... | PCEX | ||
| 8 | Tree traversal. | The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order... | PCEX | ||
| 9 | q_py_tree_preorder_traverse_es | Python PredictingFinalResult for demonstrating q_py_tree_preorder_traverse_es | QuizPET |