deepthTraversalUsingLoop.js

/* Binary Tree design - deepthTraversal using loop - pre-order*/
function deepthTraversalUsingLoop(tree) {

  let result = [];
  let stackList = [tree];

  while (stackList.length > 0) {

    let node = stackList.pop();

    result.push(node.value); // pre-order tracing 
    node.right && stackList.push(node.right);
    node.left && stackList.push(node.left);
  }

  console.log(` result of deepthTravesal using "while loop" `, result);
}
deepthTraversalUsingLoop(tree);
/* Binary Tree design - deepthTraversal using loop - in order*/
function deepthTravesalInOrderUsingLoop(tree) {

  let result = [];
  let stackList = [];

  let node = tree;

  while (!node || stackList.length > 0) {

    while (!node) {

      stackList.push(node);
      node = node.left;
    }

    node = stackList.pop();
    result.push(node.value);

    node = node.right;
  }
}
deepthTravesalInOrderUsingLoop(tree)