// Cloned by Anand on 9 Oct 2023 from World "My_Binary_tree" by Anand  
// Please leave this clone trail here.
 


// Cloned by Anand on 7 Oct 2023 from World "Binary tree" by "Coding Train" project 
// Please leave this clone trail here.
 

// Modified port of "01_binary_tree_viz" from AI course by Daniel Shiffman
// https://github.com/nature-of-code/NOC-S17-2-Intelligence-Learning/tree/master/week1-graphs

// Daniel Shiffman
// Nature of Code: Intelligence and Learning
// https://github.com/shiffman/NOC-S17-2-Intelligence-Learning

// canvas size 
const cw = 900;
const ch = 600;
   
const root_x = cw / 2;
const root_y = ch / 10;
const ellipse_size = cw / 25;

// range of numbers
const MAX = 5000;

// how many nodes 
const NONODES = 11000;

// console log how we build the tree or not 
const SHOWBUILD = true;


// Binary tree
var tree;


function setup() 
{
  createCanvas(cw,ch);


//$.getScript ( "/uploads/codingtrain/node.js", function() {
$.getScript ( "/uploads/andy054/node.js", function() {
   // console.log ("Got node");
   

    
$.getScript ( "/uploads/andy054/tree.js", function() {
      //  console.log ("Got tree");
  

        
  // New tree
  tree = new Tree();

  
  console.log ("=== build tree =================");
  // Add random values
  for (var i = 0; i < NONODES; i++) 
  {
      var n = floor(random(0, MAX));
      // console.log ("adding node: " + n);
      tree.addValue(n);
  }

  background("lightgreen");

  // Traverse the tree
  //tree.traverse();        // Traversing function -> calls node.visit  which has all the print functionality - either comment from there or here

  // Search the tree for random number 
  var x = floor(random(4000, MAX));
  AB.msg( "console log shows how we search a sorted tree quickly <br> search tree for " + x + "<br>" );
  console.log ( "=== search tree for " + x  + " ===================");
  
    
  var thisTime = millis();
  var result = tree.search(x);
  if (result == null)   AB.msg('not found', 2);
  else                  AB.msg('found', 2);
  
  console.log("Time requried to complete search =" + round(millis() - thisTime) + " ms | numNodes = " + NONODES)
  
  
} );
} );

}