GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

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
Filter options
  • algorithm/tree/binary_tree_traversal
    • inorder
      • data.js
    • postorder
      • data.js
    • preorder
      • data.js
Expand file treeCollapse file tree
Open diff view settings
Collapse file

‎algorithm/tree/binary_tree_traversal/inorder/data.js‎

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 numberDiff line numberDiff line change
@@ -27,6 +27,6 @@ var T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][1]
2727
[ 9,-1]
2828
];
2929

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( '-' ) );
3232
var logger = new LogTracer ( " Log ");
Collapse file

‎algorithm/tree/binary_tree_traversal/postorder/data.js‎

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 numberDiff line numberDiff line change
@@ -27,6 +27,6 @@ var T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][1]
2727
[ 9,-1]
2828
];
2929

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( '-' ) );
3232
var logger = new LogTracer ( " Log ");
Collapse file

‎algorithm/tree/binary_tree_traversal/preorder/data.js‎

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 numberDiff line numberDiff line change
@@ -27,6 +27,6 @@ var T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][1]
2727
[ 9,-1]
2828
];
2929

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( '-' ) );
3232
var logger = new LogTracer ( " Log ");

0 commit comments

Comments
0 (0)
You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.