Welcome to the Treehouse Community
Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.
Looking to learn something new?
Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.
Start your free trial
Calvin Secrest
24,815 PointsIs Linked List similar to recursive binary search?
If you used recursive methods operating on linked lists will it be simpler to write and easier to understand then their iterative counterparts (I become familiar with recursive methods link binary search). For example, recursive methods operating on linked list have a base case of an empty list; most have a recursive call on the next instance variable, which refers to a smaller list: one that contains one fewer node. Probably the simplest recursive method is one that returns the number of nodes in a linked list (the length of the list). Does the list node often store no state or use any state change operators?