Senior Software Engineer(L5)
You are given the root of a binary tree and an integer distance. A pair of leaf nodes is considered good if the number of edges in the shortest path between them is less than or equal to distance. Return the number of go...
