Welcome to the Treehouse Community
The Treehouse Community is a meeting place for developers, designers, and programmers of all backgrounds and skill levels to get support. Collaborate here on code errors or bugs that you need feedback on, or asking for an extra set of eyes on your latest project. Join thousands of Treehouse students and alumni in the community today. (Note: Only Treehouse students can comment or ask questions, but non-students are welcome to browse our conversations.)
Looking to learn something new?
Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and a supportive community. Start your free trial today.
Is 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?