Find k largest value in a binary search tree using javascript

FindNLargestValueInBST.js

function postOrderTraverse(tree, target, nodeInfo) {
	if (tree === null || nodeInfo.visited >= target) return
	
	postOrderTraverse(tree.right, target, nodeInfo)
	if (nodeInfo.visited < target) {
		nodeInfo.visited = nodeInfo.visited + 1
		nodeInfo.lastValue = tree.value
		postOrderTraverse(tree.left, target, nodeInfo)
	}
}

function findKthLargestValueInBst(tree, k) {
  // Write your code here.
	const nodeInfo = { visited: 0, lastValue: -1 }
  postOrderTraverse(tree, k, nodeInfo);
	return nodeInfo.lastValue
}