The points to the first node in a linked list. To indicate that a linked list it

Question

The points to the first node in a linked list. To indicate that a linked list it empty, you should set the pointer to its head to the value. In a (n) list the last node has a pointer to the first node. In a (n) list, each node has a pointer to the one before 4 and the one after it. Consider the following function to the nth Fibonacci number. long fib (long num) {if (num = = 01] num = = 1) return num. return (fib (nun - 1) + fib (num - 2));} What are the base cases and recursive cases? Write a recursive function that given a value. maxVal, returns the summation from 1 to maxVal.

Explanation / Answer

1. list head

REASON: List Head is the entry point into a linked list.

2. NULL

REASON: When the pointer to head itself is NULL which implies there are no nodes to point to. When there are no nodes, it means linked list is empty.

3. circular

Reason: To make a circle last node should point to first node.

4. doubly linked

Reason: If a node is having adress of previous node and next, it has double pointers. That's why it is called doubly linked list.

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.