@@ -0,0 +1,1299 @@
+%22%22%22Leetcode 863. All Nodes Distance K in Binary Tree%0AMedium%0A%0AURL: https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/%0A%0AWe are given a binary tree (with root node root), a target node, and an integer%0Avalue K.%0A%0AReturn a list of the values of all nodes that have a distance K from the target%0Anode.  The answer can be returned in any order.%0A%0AExample 1:%0AInput: root = %5B3,5,1,6,2,0,8,null,null,7,4%5D, target = 5, K = 2%0AOutput: %5B7,4,1%5D%0AExplanation: %0AThe nodes that are a distance 2 from the target node (with value 5)%0Ahave values 7, 4, and 1.%0ANote that the inputs %22root%22 and %22target%22 are actually TreeNodes.%0AThe descriptions of the inputs above are just serializations of these objects.%0A%0ANote:%0A- The given tree is non-empty.%0A- Each node in the tree has unique values 0 %3C= node.val %3C= 500.%0A- The target node is a node in the tree.%0A- 0 %3C= K %3C= 1000.%0A%22%22%22%0A%0A# Definition for a binary tree node.%0Aclass TreeNode(object):%0A    def __init__(self, val):%0A        self.val = val%0A        self.left = None%0A        self.right = None%0A%0A%0Aclass Solution(object):%0A    def distanceK(self, root, target, K):%0A        %22%22%22%0A        :type root: TreeNode%0A        :type target: TreeNode%0A        :type K: int%0A        :rtype: List%5Bint%5D%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc0863_all_nodes_distance_k_in_binary_tree.py