863. All Nodes Distance K in Binary Tree

We are given a binary tree (with root node root), a target node, and an integer value K.

Return a list of the values of all nodes that have a distance K from the target node.  The answer can be returned in any order.

 

Example 1:

Input: root = [3,5,1,6,2,0,8,null,null,7,4], target = 5, K = 2

Output: [7,4,1]

Explanation: 
The nodes that are a distance 2 from the target node (with value 5)
have values 7, 4, and 1.



Note that the inputs "root" and "target" are actually TreeNodes.
The descriptions of the inputs above are just serializations of these objects.

 

Note:

  1. The given tree is non-empty.
  2. Each node in the tree has unique values 0 <= node.val <= 500.
  3. The target node is a node in the tree.
  4. 0 <= K <= 1000.
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> ans;
    map<TreeNode *, TreeNode *> parent;
    set<TreeNode *> visited;
    
    void findParent(TreeNode * root)
    {
        if(!root) return;
        if(root->left)
        {
            parent[root->left] = root;
            findParent(root->left);
        }
        if(root->right)
        {
            parent[root->right] = root;
            findParent(root->right);
        }
    }
    
    void dfs(TreeNode * node, int K)
    {
        if(visited.find(node) != visited.end())
            return;
        visited.insert(node);
        if(K == 0)
        {
            ans.push_back(node->val);
            return;
        }
        if(node->left)
        {
            dfs(node->left, K-1);
        }
        if(node->right)
        {
            dfs(node->right, K-1);
        }
        TreeNode * p = parent[node];
        if(p)
            dfs(p, K-1);
    }
    
    vector<int> distanceK(TreeNode* root, TreeNode* target, int K) {
        if(!root) return {};
        findParent(root);
        dfs(target, K);
        return ans;
    }
};

 

阅读更多
换一批

没有更多推荐了,返回首页