GeezerVison is showing github.com — Fixed tracer labels for tree traversal methds · Wilsonlsc/AlgorithmVisualizer@d479037
File tree
Expand file treeCollapse file tree
Open diff view settings
algorithm/tree/binary_tree_traversal
Expand file treeCollapse file tree
Open diff view settings
Collapse file
Copy file name to clipboardExpand all lines: algorithm/tree/binary_tree_traversal/inorder/data.js +2-2Lines changed: 2 additions & 2 deletions | Original file line number | Diff line number | Diff line change |
|---|
@@ -27,6 +27,6 @@ var T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][1] |
27 | 27 | [ 9,-1] |
28 | 28 | ]; |
29 | 29 |
|
30 | | -var treeTracer = new DirectedGraphTracer( " Binary Tree Traversal Inorder ")._setTreeData ( G, 5 ); |
31 | | -var arrayTracer = new Array1DTracer( " Binary Tree Print Inorder ")._setData ( new Array(T.length).fill( '-' ) ); |
| 30 | +var treeTracer = new DirectedGraphTracer( " Traversal In-order ")._setTreeData ( G, 5 ); |
| 31 | +var arrayTracer = new Array1DTracer( " Print In-order ")._setData ( new Array(T.length).fill( '-' ) ); |
32 | 32 | var logger = new LogTracer ( " Log "); |
Collapse file
Copy file name to clipboardExpand all lines: algorithm/tree/binary_tree_traversal/postorder/data.js +2-2Lines changed: 2 additions & 2 deletions | Original file line number | Diff line number | Diff line change |
|---|
@@ -27,6 +27,6 @@ var T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][1] |
27 | 27 | [ 9,-1] |
28 | 28 | ]; |
29 | 29 |
|
30 | | -var treeTracer = new DirectedGraphTracer( " Binary Tree Traversal Inorder ")._setTreeData ( G, 5 ); |
31 | | -var arrayTracer = new Array1DTracer( " Binary Tree Print Inorder ")._setData ( new Array(T.length).fill( '-' ) ); |
| 30 | +var treeTracer = new DirectedGraphTracer( " Traversal Post-order ")._setTreeData ( G, 5 ); |
| 31 | +var arrayTracer = new Array1DTracer( " Print Post-order ")._setData ( new Array(T.length).fill( '-' ) ); |
32 | 32 | var logger = new LogTracer ( " Log "); |
Collapse file
Copy file name to clipboardExpand all lines: algorithm/tree/binary_tree_traversal/preorder/data.js +2-2Lines changed: 2 additions & 2 deletions | Original file line number | Diff line number | Diff line change |
|---|
@@ -27,6 +27,6 @@ var T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][1] |
27 | 27 | [ 9,-1] |
28 | 28 | ]; |
29 | 29 |
|
30 | | -var treeTracer = new DirectedGraphTracer( " Binary Tree Traversal Inorder ")._setTreeData ( G, 5 ); |
31 | | -var arrayTracer = new Array1DTracer( " Binary Tree Print Inorder ")._setData ( new Array(T.length).fill( '-' ) ); |
| 30 | +var treeTracer = new DirectedGraphTracer( " Traversal Pre-order ")._setTreeData ( G, 5 ); |
| 31 | +var arrayTracer = new Array1DTracer( " Print Pre-order ")._setData ( new Array(T.length).fill( '-' ) ); |
32 | 32 | var logger = new LogTracer ( " Log "); |