Moving keyboard focus in a split-pane layout costs one step per edge of the layout tree. You want to know how many steps it takes to go from one pane to another.
Write stepsBetween(root, a, b) that returns the number of edges on the path between the node with value a and the node with value b. Values are unique and both exist. If a === b, return 0.
Input: root = [1,2,3,4,5,6,7], a = 4, b = 5 Output: 2
4 → 2 → 5 uses two edges.
Input: root = [1,2,3,4,5,6,7], a = 4, b = 7 Output: 4
4 → 2 → 1 → 3 → 7.
1 <= number of nodes <= 10^4Trees are written level by level, like [1, 2, 3, null, 4], where null is a missing child. Your function works with TreeNode objects, each with val, left, and right.
Run tries your code on the examples. Submit runs every test, including hidden edge cases, and solves the problem when they all pass.
Ctrl + Enter runs, Ctrl + Shift + Enter submits (⌘ on a Mac).
I'm here to help with #345 Splits Between Two Panes. I give hints, never the solution, so you get to solve it yourself. Ask for a hint, select code to ask about it, or press Ask Tuto why on a failing test.
Your first 3 answers need no account. for free to keep asking.