Motive | Senior Software Engineer(L5) | Coding | Phone Screen

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 good leaf node pairs in the tree. 1 / \ 2 3 / / \ 4 5 6 Details Leaf nodes: 4, 5, 6 Distance definition: number of edges Example distance: dist(4,5) = 4 → 2 → 1 → 3 → 5 = 3 edges follow up: You are give...