Find second minimum

function findMinFromTree(node) {
	let minValue = node.value
  let minArray = [minValue]
  
  --------------------------------------------------------------
  
  if (node.left) {
  	minArray.concat(findMinFromTree(node.left))
  }
  if (node.right) {
  	minArray.concat(findMinFromTree(node.right))
  }
  
  let sorted = minArray.sort(a, b => a - b)
  return sorted.slice(0, 2)
  
  --------------------------------------------------------------
  
  if (node.left) {
  	let leftMin = findMinFromTree(node.left)
  	for (let x = 0; x < leftMin.length; x++) {
    	if (leftMin[x] < minArray[0]) minArray.unshift(leftMin[x])
      else if (leftMin[x] < minArray[1]) minArray[1] = leftMin[x]
      else if (!minArray[1]) minArray[1] = leftMin[x]
    }
  }
  if (node.right) {
  	let rightMin = findMinFromTree(node.left)
  	for (let x = 0; x < rightMin.length; x++) {
    	if (rightMin[x] < minArray[0]) minArray.unshift(rightMin[x])
      else if (rightMin[x] < minArray[1]) minArray[1] = rightMin[x]
      else if (!minArray[1]) minArray[1] = rightMin[x]
    }
  }
  return minArray
}

function findSecondSmallest(node) {
	let minArray = findMinFromTree(node)
  return minArray[1]
}