Javascript Interview Question Tree Binary Tree

Introduction

Create the following binary search tree: 

*          15
*          /\
*        13  20
*        /\   /\
*      11 15 18 22





/**
 * @class {public} Node
 *
 * A typical binary tree node.
 *
 * @param {Node} left - the left node.
 * @param {Node} right - the right node.
 * @param {Integer} value - the value of this node.
 */
function Node(left, right, value) {
    this.left = left;
    this.right = right;
    this.value = value;
}

/*
 * Sample structure.
 */
var root = new Node(
    new Node(
        new Node(null, null, 11),
        new Node(null, null, 15),
        13
    ),
    new Node(
        new Node(null, null, 18),
        new Node(null, null, 22),
        20
    ),
    15
);
console.log(root);
/*
Output: ($ /usr/bin/node 003.js)
{ left:
   { left: { left: null, right: null, value: 11 },
     right: { left: null, right: null, value: 15 },
     value: 13 },
  right:
   { left: { left: null, right: null, value: 18 },
     right: { left: null, right: null, value: 22 },
     value: 20 },
  value: 15 }
*/



PreviousNext

Related