b. With the aid of suitable diagram, explain how a node is inserted in a Singly Linked list.

Answer the given question with a proper explanation and step-by-step solution. the popBack() function fails when the node is empty the insertStudent only looks until a certain point

Write a program in C++ to implement simple Binary Tree and print the tree nodes through In-Order Traversal,also write function to find level of each node.

Write the C++ code for a function that takes the vector representation of a complete binary tree and returns true if it is a maxHeap and false if it is not.

Write a recursive function treeToList(Node root) that takesan ordered binary tree and rearranges the internal pointers to make a circular doubly linked list outof the tree nodes. The "previous" pointers should be stored in the "small" field and the "next"pointers should be stored in the "large" field. The list should be arranged so that the nodes are inincreasing order. Return the head pointer to the new list. The operation can be done in O(n) time -- essentially operating on each node once. Try the problem directly, or see the hints below.Hint #1 The recursion is key. Trust that the recursive call on each sub-tree works and concentrate onassembling the outputs of the recursive calls to build the result. It's too complex to delve into howeach recursive call is going to work -- trust that it did work and assemble the answer from there.Hint #2The recursion will go down the tree, recursively changing the small and large sub-trees into lists,and then append those lists together with the…

Write a LISP function, outdegree, of two arguments, a node and the graph, which returns the outdegree of the node. (the outdegree of a node, k, is the number of arcs coming out of the node, i.e. # of arcs that have the node k as a source). The graph is represented by the adjacency list representation.

How to measure time elapsed in binary search tree (BST) using C++? Show the codes

Is it possible to implement a sorted linked list with a DLL? What advantage a DLL implementation may have over a singly linked list? Use a specific example or application to support your argument.

Your second function is called “isTree". Its input is a graph G, which is a dictionary whose keys are the vertices, and whose values are lists of vertices that are adjacent to the given vertex. Its output is True if G is a tree and False if G is not a tree. Hint: You may want to make use of your "connected" function from the last coding assignment.