Which of the following can be the base case for the recursive implementation used to find the length of linked list?if(current_node == 0) return 1if(current_node->next == 0) return 0if(current_node->next == 0) return 1if(current_node == 0) return 0

7. Write a recursive algorithm that calculates and returns the length of a list.

Which type of linked list has its last node pointing back to the first node?a.Singly linked listb.Circular linked listc.Doubly linked listd.Linear linked list

What data structure would you mostly likely see in non recursive implementation of a recursive algorithm? Options Stack Linked List Tree Queue

Which of the following data structures finds its use in recursion?

Given a Linked List Representation of Complete Binary Tree. Your task is to construct the Binary tree from the given linkedlist and return the root of the tree.The result will be judged by printing the level order traversal of the Binary tree. Note: The complete binary tree is represented as a linked list in a way where if the root node is stored at position i, its left, and right children are stored at position 2*i+1, and 2*i+2 respectively. H is the height of the tree and this space is used implicitly for the recursion stack.