diff --git a/lectures/23_priority_queues/README.md b/lectures/23_priority_queues/README.md
index ad32397..e2690d7 100644
--- a/lectures/23_priority_queues/README.md
+++ b/lectures/23_priority_queues/README.md
@@ -159,6 +159,8 @@ int main() {
 5 4 3 3 1
 ```
 
+- Play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/priority_queue/max_heap/index.html) to see how this program works.
+
 - You can use std::priority_queue as a min heap via using std::greater, as can be seen in this [example](min_heap.cpp):
 
 ```cpp
@@ -190,6 +192,8 @@ int main() {
 1 3 3 4 5
 ```
 
+- Play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/priority_queue/min_heap/index.html) to see how this program works.
+
 ## 23.6 Overloading operator()
 
 - When using std::priority_queue to store class objects, oftentimes, you need to define a class and overload its function call operator.<!--; or use a lambda expression.-->