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?

C++ Program  #include <iostream>#include <cstdlib>#include <ctime>using namespace std; int getData() {    return (rand() % 100);} class Node {public:    int data;    Node* next;}; class LinkedList{public:    LinkedList() { // constructor        head = NULL;    }    ~LinkedList() {}; // destructor    void addNode(int val);    void addNodeSorted(int val);    void displayWithCount();    int size();    void deleteAllNodes();    bool exists(int val);private:    Node* head;}; // function to check data exist in a listbool LinkedList::exists(int val){         if (head == NULL) {        return false;    }    else {        Node* temp = head;        while (temp != NULL) {                       if(temp->data == val){                return true;            }            temp = temp->next;        }    }    return false;} // function to delete all data in a listvoid LinkedList::deleteAllNodes(){        if (head == NULL) {        cout << "List is empty, No need to delete…

#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

Data structure & Alogrithums java program A system of caves is a group of connected undergrounds tunnels. Design an ADT for a cave and cave system. An archaelogist should be able to add a newly discovered cave to a cave system. He/she can enter this system through only one cave and exit the system only through a different cave. Duplicate caves - based on GPS coordinates - are not permitted. Archaelogoist should also be able to list the caves in a given cave system.

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:.

Data Structures/Algorithms in Java

Computer Science Part C: Interactive Driver Program Write an interactive driver program that creates a Course object (you can decide the name and roster/waitlist sizes). Then, use a loop to interactively allow the user to add students, drop students, or view the course. Display the result (success/failure) of each add/drop.

IN PYTHON THANK YOU

Course: Data Structure and Algorithims Language: Java Kindly make the program in 2 hours. Task is well explained.  You have to make the proogram properly in Java: Restriction: Prototype cannot be change you have to make program by using given prototype. TAsk: Create a class Node having two data members int data;     Node next;   Write the parametrized constructor of the class Node which contain one parameter int value assign this value to data and assign next to null Create class LinkList having one data members of type Node. Node head Write the following function in the LinkList class publicvoidinsertAtLast(int data);//this function add node at the end of the list publicvoid insertAthead(int data);//this function add node at the head of the list publicvoid deleteNode(int key);//this function find a node containing "key" and delete it publicvoid printLinkList();//this function print all the values in the Linklist public LinkListmergeList(LinkList l1,LinkList l2);// this function…

struct nodeType {    int infoData;    nodeType * next; };   nodeType *first;   … and containing the values(see image) Using a loop to reach the end of the list, write a code segment that deletes all the nodes in the list. Ensure the code performs all memory ‘cleanup’ functions.