/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @param {number} k
 * @return {number}
 */
var findClosestLeaf = function(root, k) {
  const graph = new Map();
  const leaves = new Set();

  buildGraph(root, null);

  const queue = [k];
  const visited = new Set([k]);

  while (queue.length) {
    const current = queue.shift();
    if (leaves.has(current)) return current;

    for (const neighbor of graph.get(current) || []) {
      if (!visited.has(neighbor)) {
        visited.add(neighbor);
        queue.push(neighbor);
      }
    }
  }

  return -1;

  function buildGraph(node, parent) {
    if (!node) return;
    if (!node.left && !node.right) leaves.add(node.val);
    if (parent) {
      if (!graph.has(node.val)) graph.set(node.val, new Set());
      if (!graph.has(parent.val)) graph.set(parent.val, new Set());
      graph.get(node.val).add(parent.val);
      graph.get(parent.val).add(node.val);
    }
    buildGraph(node.left, node);
    buildGraph(node.right, node);
  }
};