Q1. Define the given terms:
a) Complete Binary tree
b) Extended Binary tree
c) AVL tree
Q2. prepare down a function to reverse the links in a linked list in such a way that the last node becomes the first and the first becomes the last through traversing the linked list just once.
Q3. Describe Dijkstra’s algorithm for determining the shortest path in a particular graph.
Q4. Consider the graph G shown below. Apply the depth-first search of G beginning at J.
Q5. prepare down a C function strend(s, t), that returns 1 if the string t takes place at the end of string s, and zero or else.
Q6. Define the term maxheap and minheap? How will you symbolize a max-heap as an array? prepare down an algorithm to insert the element to a max-heap.