You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In function _insert(), the midpoint of the interval was incorrectly
calculated for left-hand traversal as (itvl.start + itvl.end / 2). This
causes infinite recursion whenever a node is inserted below a parent
where (itvl.end < idx) and (itvl.end < 2 * itvl.start).
Changing the readme example to:
Will raise a
Maximum call stack size exceeded
inSortedList.js:26:17
.Is there something wrong with this code?
ps. [email protected]
The text was updated successfully, but these errors were encountered: