Javascript converts an array from small to large into a binary search tree

This article mainly introduces the relevant information of Javascriptconverting arraysfrom small to large into binary searchtrees. Friends in need can refer to the following

No more nonsense, let me just post the code for you. The specific code is as follows:

var Array = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]; 
var Tree = createTree(Array); 
console.log(Tree); 
// 构造一个节点 
function Node(nodeData, leftData, rightData) { 
  this.nodeData = nodeData; 
  this.leftData = leftData; 
  this.rightData = rightData; 
} 
// 每次取中点作为根节点,向左和向右递归 
function createTree(array) { 
  if (array.length <= 0) { 
    return null; 
  } else { 
    var mid = parseInt(array.length / 2); 
    var node = new Node(array[mid], null, null); 
    var leftArray = array.slice(0 , mid); 
    var rightArray = array.slice(mid + 1 , array.length ); 
    node.leftData = createTree(leftArray); 
    node.rightData = createTree(rightArray); 
    return node; 
  } 
}

The above is the Javascript implementation introduced by the editor to convert small to large arrays. into a binary search tree. I hope it will be helpful to everyone. If you have any questions, please leave me a message and the editor will reply to you in time. I would also like to thank you all for your support of the Script House website!

The above is the detailed content of Javascript converts an array from small to large into a binary search tree. For more information, please follow other related articles on the PHP Chinese website!