Code
The highlighted line runs next. The pill shows the live values in the running call.
Cost
Work done so far, and how the two solutions compare
The BST
Nodes are drawn left to right in sorted order
The highlighted line runs next. The pill shows the live values in the running call.
Work done so far, and how the two solutions compare
Nodes are drawn left to right in sorted order
Keyboard: ← → step, Space play or pause. Enter the tree in level order with null for missing children, as LeetCode does (2 to 15 nodes, 5 levels, unique values −100 to 100; the tree must be a valid BST). Type p and q as two values that are in the tree.