Given the following C code: struct Node int data; struct Node prev; struct Node next; struct Node head;: void funx () if (head==NULL) return; struct Node current=head; while (current->next!=NULL) current=current->next; while (current!=NULL) printf("+d ", current->data; current=current->prev;

#ifndef LLCP_INT_H#define LLCP_INT_H #include <iostream> struct Node{   int data;   Node *link;};void DelOddCopEven(Node*& headPtr);int    FindListLength(Node* headPtr);bool   IsSortedUp(Node* headPtr);void   InsertAsHead(Node*& headPtr, int value);void   InsertAsTail(Node*& headPtr, int value);void   InsertSortedUp(Node*& headPtr, int value);bool   DelFirstTargetNode(Node*& headPtr, int target);bool   DelNodeBefore1stMatch(Node*& headPtr, int target);void   ShowAll(std::ostream& outs, Node* headPtr);void   FindMinMax(Node* headPtr, int& minValue, int& maxValue);double FindAverage(Node* headPtr);void   ListClear(Node*& headPtr, int noMsg = 0); // prototype of DelOddCopEven of Assignment 5 Part 1 #endif

def is_balanced(root):    return __is_balanced_recursive(root) def __is_balanced_recursive(root):    """    O(N) solution    """    return -1 != __get_depth(root) def __get_depth(root):    """    return 0 if unbalanced else depth + 1    """    if root is None:        return 0    left = __get_depth(root.left)    right = __get_depth(root.right)    if abs(left-right) > 1 or -1 in [left, right]:        return -1    return 1 + max(left, right) # def is_balanced(root):#     """#     O(N^2) solution#     """#     left = max_height(root.left)#     right = max_height(root.right)#     return abs(left-right) <= 1 and is_balanced(root.left) and#     is_balanced(root.right) # def max_height(root):#     if root is None:.

// FILL IN THE BLANKS (LINKED-LISTS CODE) (C++)#include<iostream>using namespace std; struct ________ {int data ;struct node *next; };   node *head = ________;node *createNode() { // allocate a memorynode __________;temp = new node ;return _______ ;} void insertNode(){node *temp, *traverse;int n;cout<< "Enter -1 to end "<<endl;cout<< "Enter the values to be added in list"<<endl;cin>>n; while(n!=-1){temp = createNode(); // allocate memorytemp->data = ________;temp->next = ________;if ( ___________ == NULL){head = _________;} else {traverse = ( );while (traverse->next != ________{traverse = traverse-> ___________;} traverse->next= temp;} cout<<"Enter the value to be added in the list"<<endl;cin>>n; }} void printlist(){node *traverse = head; // if head == NULLwhile (traverse != NULL) { cout<<traverse->data<<" ";traverse = traverse->next;}} int main(){int option; do{cout<<"\n =============== MAIN…

What happens when a programmer attempts to access a node's data fields when the node variable refers to None? How do you guard against it? *PYTHON

#include <iostream>#include <vector>using namespace std; void PrintVectors(vector<int> numsList) {   unsigned int i;    for (i = 0; i < numsList.size(); ++i) {      cout << numsList.at(i) << " ";   }   cout << endl;} int main() {   vector<int> numsList;   int userInput;   int i;    for (i = 0; i < 3; ++i) {      cin >> userInput;      numsList.push_back(userInput);   }    numsList.erase(numsList.begin()+1);   numsList.insert(numsList.begin()+1, 102);   numsList.insert(numsList.begin()+1, 100);    PrintVectors(numsList);    return 0;} Not all tests passed   clearTesting with inputs: 33 200 10 Output differs. See highlights below. Special character legend Your output 33 100 102 10 Expected output 100 33 102 10 clearTesting with inputs: 6 7 8 Output differs. See highlights below. Special character legend Your output 6 100 102 8 Expected output 100 6 102 8   Not sure what I did wrong but the the 33…

C++ Given code #include <iostream>using namespace std; class Node {public:int data;Node *pNext;};   void displayNumberValues( Node *pHead){while( pHead != NULL) {cout << pHead->data << " ";pHead = pHead->pNext;}cout << endl;}   //Option 1: Search the list// TODO: complete the function below to search for a given value in linked lsit// return true if value exists in the list, return false otherwise. ?? linkedlistSearch( ???){ } //Option 2: get sum of all values// TODO: complete the function below to return the sum of all elements in the linked list. ??? getSumOfAllNumbers( ???){ }   int main(){int userInput;Node *pHead = NULL;Node *pTemp;cout<<"Enter list numbers separated by space, followed by -1: "; cin >> userInput;// Keep looping until end of input flag of -1 is givenwhile( userInput != -1) {// Store this number on the listpTemp = new Node;pTemp->data = userInput;pTemp->pNext = pHead;pHead = pTemp;cin >> userInput;}cout <<"…

use code below in part with bts #include <stdio.h>#include <stdlib.h>#include <time.h> typedef struct node_struct {int item;struct node_struct *next;} node; /*** 10->NULL* We want to insert 20* First call ([10], 20) [not complete]* {10, {20, NULL}} To compute the conditional probabilities you need to determine unigram andbigram counts first (you can do this in a single pass through a file if you do thingscarefully) and store them in a Binary Search Tree (BST). After that, you can computethe conditional probabilities.Input filesTest files can be found on (http://www.gutenberg.org/ebooks/). For example,search for “Mark Twain.” Then click on any of his books. Next download the “PlainText UTF-8” format.In addition, you should test your program on other input files as well, for which youcan hand-compute the correct answer.Output filesYour program must accept the name of an input file as a command line argument.Let's call the file name of this file fn. Your program must…

#ifndef NODES_LLOLL_H#define NODES_LLOLL_H #include <iostream>    // for ostream namespace CS3358_SP2023_A5P2{   // child node   struct CNode   {      int data;      CNode* link;   };    // parent node   struct PNode   {      CNode* data;      PNode* link;   };    // toolkit functions for LLoLL based on above node definitions   void Destroy_cList(CNode*& cListHead);   void Destroy_pList(PNode*& pListHead);   void ShowAll_DF(PNode* pListHead, std::ostream& outs);   void ShowAll_BF(PNode* pListHead, std::ostream& outs);} #endif #include "nodes_LLoLL.h"#include "cnPtrQueue.h"#include <iostream>using namespace std; namespace CS3358_SP2023_A5P2{       // do breadth-first (level) traversal and print data   void ShowAll_BF(PNode* pListHead, ostream& outs)   {       cnPtrQueue queue;      CNode* currentNode;       queue.push(lloLLPtr->getHead());       while (!queue.empty())      {         currentNode = queue.front();         queue.pop();          if…