Solution Approach Corrections for

https://neetcode.io/problems/invert-a-binary-tree andhttps://neetcode.io/problems/depth-of-binary-tree

I noticed some BST solutions using the Breadth First Search approach in JavaScript where queue.pop() was used to remove an item from the queue. However, it should actually be queue.shift() instead.