farthest leaf

by Diana Lemen

JavaScript

const root = {
	val: 3,
  left: { val: 9 },
  right: {
  	val: 20,
    left: { val: 15 },
    right: { val: 7 }
  }
}

function traverse(node, depth, maxDepth) {
	depth = depth + 1;
  if(maxDepth.max < depth) maxDepth.max = depth;
  if(node.right) traverse(node.right, depth, maxDepth);
	if(node.left) traverse(node.left, depth, maxDepth);
}

function getMaxDepth() {
	const depth = 0;
  const maxDepth = { max: depth }
  traverse(root, depth, maxDepth);
	return maxDepth. max;
}

console.log(getMaxDepth());