From 1dd5fd18458881d0276d09367c7d121b63dcce3b Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Mon, 2 Oct 2023 11:05:03 -0400 Subject: [PATCH] adding push back and push front animations --- lectures/10_linked_lists/README.md | 10 +++++++--- 1 file changed, 7 insertions(+), 3 deletions(-) diff --git a/lectures/10_linked_lists/README.md b/lectures/10_linked_lists/README.md index 10cb45f..1de2050 100644 --- a/lectures/10_linked_lists/README.md +++ b/lectures/10_linked_lists/README.md @@ -233,7 +233,9 @@ template void push_front( Node* & head, T const& value ) { } ``` -- If the input linked list chain contains n elements, what is the order notation of the implementation of push front? +- Play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/lists/push_front/index.html) to see how push_front works. + +- If the input linked list chain contains n elements, what is the order notation of the implementation of push_front? ## 10.11 Exercise: Write push_back @@ -247,8 +249,10 @@ template void push_back( Node* & head, T const& value ) { } ``` -- If the input linked list chain contains n elements, what is the order notation of this implementation of -push back? + +- Play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/lists/push_back/index.html) to see how push_back works. + +- If the input linked list chain contains n elements, what is the order notation of this implementation of push_back? ## 10.12 Inserting a Node into a Singly-Linked List