During all Python/ Java /JavaScript Basic Data Strutures, breath-first search are typo…so can be fixed by “breadth-first search”.
Appending an element to the end of a Linked List is O(N) unless the Linked List has a ‘tail’ pointer. With a tail pointer, appending an element to the end is O(1).
1 Like