Find the Kth smallest element on a Binary Search Tree

kthSmallestElementBST

/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @param {number} k
 * @return {number}
 */
var kthSmallest = function(root, k) {
  //Create a storage array for all the values in the tree
  var values = [];
  //Go to the root, push the value of the root to the array
  var traverseTree = function (node) {
    values.push(node.val);
  //if there's a right
    if (node.right){
      //push that value into the array
      values.push(node.right);
    //if there's a left
    } else if (node.left) {
    //push that value into the array
    values.push(node.right)
    } else {
      return
    }
    traverseTree(root.right)
    traverseTree(root.left)
  }
  return values
};