【Lintcode】854. Closest Leaf in a Binary Tree

题目地址：

https://www.lintcode.com/problem/854/description

给定一棵二叉树，每个节点值不同。再给定一个其中节点的数值$k$，求离$k$最近的叶子节点（如果$k$本身就是叶子，则返回其本身）。如果有多个解，则优先返回其左子树中的；如果左子树为空，则优先返回其右子树中的。

先BFS一遍，找到节点$k$，并且存一下每个节点的父亲。接着再BFS一遍，求离$k$最近的叶子。入队的时候要按照左右父这种顺序。代码如下：

import java.util.*;

public class Solution {
    /**
     * @param root: the root
     * @param k:    an integer
     * @return: the value of the nearest leaf node to target k in the tree
     */
    public int findClosestLeaf(TreeNode root, int k) {
        // Write your code here
        Map<TreeNode, TreeNode> par = new HashMap<>();
        Queue<TreeNode> q = new LinkedList<>();
        TreeNode nodek = null;
        q.offer(root);
        while (!q.isEmpty()) {
            TreeNode cur = q.poll();
            if (cur.val == k) {
                nodek = cur;
            }
            
            if (cur.left != null) {
                par.put(cur.left, cur);
                q.offer(cur.left);
            }
            if (cur.right != null) {
                par.put(cur.right, cur);
                q.offer(cur.right);
            }
        }
        
        q.offer(nodek);
        Set<TreeNode> set = new HashSet<>();
        set.add(nodek);
        while (!q.isEmpty()) {
            TreeNode cur = q.poll();
            if (cur == null) {
                continue;
            }
            
            if (cur.left == null && cur.right == null) {
                return cur.val;
            }
            
            if (cur.left != null && !set.contains(cur.left)) {
                q.offer(cur.left);
                set.add(cur.left);
            }
            if (cur.right != null && !set.contains(cur.right)) {
                q.offer(cur.right);
                set.add(cur.right);
            }
            if (par.containsKey(cur) && !set.contains(par.get(cur))) {
                q.offer(par.get(cur));
                set.add(par.get(cur));
            }
        }
        
        return -1;
    }
}

class TreeNode {
    int val;
    TreeNode left, right;
    
    public TreeNode(int val) {
        this.val = val;
    }
}

时空复杂度$O(n)$，$n$为节点个数。