Skip to content

Conversation

@Catherina87
Copy link

No description provided.

Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Nice work Kate, you hit all the learning goals here. Well done.

Comment on lines +2 to +6
Time Complexity: O(n)
Space Complexity: O(n)
*/

const Stack = require("./stack");

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

this.rear = -1;
}

enqueue(element) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

}
}

dequeue() {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines 43 to 45
size() {
throw new Error("This method has not been implemented!");
return this.array.length;
}

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This really should be the number of elements used in the Queue.

@@ -1,24 +1,32 @@
const LinkedList = require("./linked-list");

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants