voidnerd

class Node {
    constructor(data) {
        this.data = data;
        this.next = null;
    }
}
class LinkedList {
    constructor () {
        this.head = null;
        this.size = 0;

voidnerd

class Node {
    constructor(data) {
        this.left;
        this.right;
        this.data = data;
    }

    insert(value) {
        if(value < this.data) {
            if(this.left == null) {

voidnerd

class Node {
  constructor(data, left = null, right = null) {
    this.left = left;
    this.right = right;
    this.data = data;
  }
}

class BST {
  constructor() {

voidnerd

#include <stdio.h>
#include <cs50.h>
#include <math.h>

int main(void) {
    long card_no;
    do{
        card_no = get_long("Card Number: ");
    }while(card_no < 1);

voidnerd

#include <cs50.h>
#include <stdio.h>

int main(void)
{
    int n;
 do {
    n = get_int("height: ");
 }while(n < 1 || n > 8);

voidnerd

#include <stdio.h>
#include <cs50.h>
#include <ctype.h>
#include <string.h>
#include <math.h>


int main(void)
{
    string text = get_string("Text:");

voidnerd

#include <stdio.h>
#include <ctype.h>
#include <cs50.h>
#include <string.h>
#include <stdlib.h>

bool isNumber(char number[]);

int main(int argc, string argv[])
{

voidnerd

#include <stdio.h>
#include <ctype.h>
#include <cs50.h>
#include <string.h>
#include <stdlib.h>

bool isAlpha(string key);
bool hasDuplicates(string key);

int main(int argc, string argv[])

voidnerd

#include <cs50.h>
#include <stdio.h>
#include <string.h>

// Max number of candidates
#define MAX 9

// Candidates have name and vote count
typedef struct
{

voidnerd

#include <cs50.h>
#include <stdio.h>
#include <string.h>

// Max voters and candidates
#define MAX_VOTERS 100
#define MAX_CANDIDATES 9

// preferences[i][j] is jth preference for voter i
int preferences[MAX_VOTERS][MAX_CANDIDATES];