这个ReasonmL程序的大型O类运行时是O(n-> n)吗?
let rec fastHelper: (binTree('a),list('a)) => list('a) = (tree,lst) =>
switch(tree){
|Leaf => lst
|Node(a1,leftTree,rightTree) => fastHelper(leftTree,[a1,... fastHelper(rightTree,lst)])
|_ => failwith("Invalid tree")
}
如果没有,我将如何找到其真正的big-O运行时?