Binary Tree in Order Traversal - Node.js Data Structure

Node.js examples for Data Structure:Binary Tree

  1. HOME
  2. Node.js
  3. Data Structure
  4. Binary Tree

Description

Binary Tree in Order Traversal

Demo Code


var BinaryTree = function (val) {
  this.val = val;//from  www. java  2  s.c  o m
  this.left = null;
  this.right = null;
};

BinaryTree.prototype.insert = function (val) {
  if (val === this.val) {
    return;
  } else if (val <= this.val) {
    if (this.left === null) {
      this.left = new BinaryTree(val);  
    } else {
      this.left.insert(val);
    }
  } else {
    if (this.right === null) {
      this.right = new BinaryTree(val);  
    } else {
      this.right.insert(val);
    }
  }
};

var inOrderTraversal = function (root, results) {
  if (!root) {
    return null;
  }
  
  if (root.left !== null) {
    inOrderTraversal(root.left, results);
  }
  results.push(root.val)
  if (root.right !== null) {
    inOrderTraversal(root.right, results);
  }
  
  return results;
}

var test1 = new BinaryTree(15)
test1.insert(7);
test1.insert(22);
test1.insert(12);
test1.insert(5);
test1.insert(50);
test1.insert(17);

console.log(inOrderTraversal(test1, []));

Related Tutorials