Applying unique pointers to our data structures

On this page

Examples
Questions

This lesson contains approximately 30 minutes of video content.

Examples

Questions

QApplying unique pointers to our data structures, Q1

This question is ungraded.

According to the lesson, when implementing a doubly linked list using smart pointers, the doubly linked list's head pointer should be implemented using which smart pointer type?

`raw pointer`.

`std::shared_ptr`.

`std::unique_ptr`.

`std::weak_ptr`.

Practice question: try as many times as you like

QApplying unique pointers to our data structures, Q2

This question is ungraded.

According to the lesson, when implementing a doubly linked list using smart pointers, each node object in the sequence should have its next and previous node pointers typed (select the best response):

both `std::unique_ptr`s.

next as an `std::shared_ptr` and prev as a `raw pointer`.

next as an `std::unique_ptr` and prev as a `raw pointer`.

next as an `std::unique_ptr` and prev as an `std::weak_ptr`.

Practice question: try as many times as you like