code.h

#ifndef CODE_H
#define CODE_H
#include <string>

/* Problem 1: 10 points
Professor Kharitonova loves to drink different types of tea. 
At home, she has many different tea packets, each with an `rating` and `rarity`. 
This assortment is represented as a linked list of `TeaPacket` objects.

Define the `value` of a packet to be `rarity * rating`. 
Given the head of her linked list of `TeaPacket` objects, 
write a RECURSIVE function to return the address of the `TeaPacket` 
with the greatest `value`.
If the linked list is empty, return 0;
If multiple TeaPackets have the greatest value, 
return the one that appears earliest in the linked list
*/

struct TeaPacket{
    int rating;
    int rarity;
    TeaPacket *next;
};

// Implement the function below. 
TeaPacket* bestPacket(TeaPacket *head);

/***********************************************/

/* Problem 2: 10 points
Given a single linked list of nodes in ascending order by their `data` values and 
a value `val` to insert, insert a new node with the given value such that the resulting 
linked list remains sorted (in ascending order). Return the head of the modified linked list.
Use the definition of Node provided below:

*/

struct Node{
    int data;
    Node *next;
};
Node* insert(Node *head, int value);


/************************************************/

/* Problem 3: 10 points

Suppose that you are given a string that only contains characters A and B. 
Additionally the string may have all As or all Bs or may be empty. 
Define a string to be **balanced** if the number of A's match the number of B's.
You may consider an empty string to be balanced
*/

// Given a string s that contains only A's and B's, 
// return true if s is "balanced", otherwise return false.

bool isBalanced(std::string s);

#endif