Big O Notation for Binary Search Trees

Daniel Stor: http://turnoff.us/geek/binary-tree/

What’s a Binary Search Tree?

The Big O (notation)

function add(num1, num2) {
return num1 + num2;
}
function loopThroughArray(array) {
for (let i = 0; i < array.length; i++) {
console.log(array[i]);
}
};
function nestedArrayLoop(arr1,v ) {
for (let i = 0; i < array.length; i++) {
for (let j = 0; j < array[i].length; j++) {
console.log(array[i][j];
}
}
}

Remind me what a logarithm is again?

Space Complexity

DevOps Developer based out of New Orleans, LA