Commit 8ae54f2

authored

doc: update traversal_v1.py

1 parent 48d4b59 commit 8ae54f2Copy full SHA for 8ae54f2

File tree

-5

lines changed

-5

lines changed

Lines changed: 0 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -48,9 +48,4 @@ def traverse(head):`
`48`	`48`	The function creates a new list `nodes` to store the values. The size of this list grows in proportion to the number
`49`	`49`	`of nodes in the linked list.`
`50`	`50`
`51`		`-Further Notes:`
`52`		`-This code implements a simple linked list traversal using a single loop. While efficient and easy to understand, consider`
`53`		`-alternative approaches if you need to perform operations on the nodes themselves (e.g., modify values or links). These`
`54`		`-alternative approaches might directly manipulate the nodes in the linked list, potentially avoiding the creation of an`
`55`		`-additional list.`
`56`	`51`	`"""`

Comments

(0)