updating the animation path
This commit is contained in:
committed by
JamesFlare1212
parent
3fd45d0b8c
commit
d6ef9dff46
@@ -27,19 +27,15 @@ We will use this binary tree as a test case:
|
||||
|
||||
An in-order traversal program is provided here: [inorder_iterative.cpp](inorder_iterative.cpp).
|
||||
|
||||
Play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/trees/iterative/inorder/inorder.html) to understand how this works.
|
||||
|
||||
## 21.1.2 Pre-order Iteratively
|
||||
|
||||
A pre-order traversal program is provided here: [preorder_iterative.cpp](preorder_iterative.cpp).
|
||||
|
||||
Play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/trees/iterative/preorder/preorder.html) to understand how this works.
|
||||
|
||||
## 21.1.3 Post-order Iteratively
|
||||
|
||||
A post-order traversal program is provided here: [postorder_iterative.cpp](postorder_iterative.cpp).
|
||||
|
||||
Play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/trees/iterative/postorder/postorder.html) to understand how this works.
|
||||
Play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/trees/iterative/traversal.html) to understand how these traversals work.
|
||||
|
||||
## 21.2 Existing Binary Tree Traversals
|
||||
|
||||
|
||||
Reference in New Issue
Block a user