Data Structures on JavaScript can be really slow. In my test, Insertion and Search operation in
a Binary Search Tree grows exponentially instead of the expe
Data Structures on JavaScript can be really slow. In my test, Insertion and Search operation in
a Binary Search Tree grows exponentially instead of the expected O(N * log N) in JavaScript, which is resolved
using Web Assembly.