diff --git a/exercises/practice/doubly-linked-list/.meta/example.rs b/exercises/practice/doubly-linked-list/.meta/example.rs
index f5c067fb5e0..f9cb36ed581 100644
--- a/exercises/practice/doubly-linked-list/.meta/example.rs
+++ b/exercises/practice/doubly-linked-list/.meta/example.rs
@@ -50,14 +50,11 @@ struct Node<T> {
 
 impl<T> Node<T> {
     fn new_linkless(element: T) -> NodePtr<T> {
-        unsafe {
-            // new_unchecked() is trivially safe as we have just allocated a new Box
-            NonNull::new_unchecked(Box::into_raw(Box::new(Self {
-                element,
-                prev: None,
-                next: None,
-            })))
-        }
+        Box::into_non_null(Box::new(Self {
+            element,
+            prev: None,
+            next: None,
+        }))
     }
 
     // `left` and `right` must point to adjacent nodes