Closest Binary Search Tree Value II

cpp

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<int> closestKValues(TreeNode* root, double target, int k) {
        
    }
};

java

class Solution {
    public void dfs(TreeNode node, Deque<Integer> dq, int k, double target) {
        if (node == null) return;

        dfs(node.left, dq, k, target);
        dq.addLast(node.val);

        if (dq.size() > k) {
            if (Math.abs(target - dq.peekFirst()) <= Math.abs(target - dq.peekLast())) {
                dq.pollLast();
                return;
            } else {
                dq.pollFirst();
            }
        }

        dfs(node.right, dq, k, target);
    }

    public List<Integer> closestKValues(TreeNode root, double target, int k) {
        // Your code goes here
        Deque<Integer> dq = new LinkedList<>();
        dfs(root, dq, k, target);
        return new ArrayList<>(dq);
    }
}

python

class Solution:
    def closestKValues(self, root, target, k):
        # Your code goes here

javascript

class Solution {
    closestKValues(root, target, k) {
        // Your code goes here
    }
}

csharp

public class Solution {
    public IList<int> ClosestKValues(TreeNode root, double target, int k) {
        // Your code goes here
    }
}

go

/*
Definition for a binary tree node.
type TreeNode struct {
      Val int
      Left *TreeNode
      Right *TreeNode
}
*/

func closestKValues(root *TreeNode, target float64, k int) []int {

}