This document provides an overview of various topics related to computer science including: CS50 IDE, check50, debug50, help50, printf, style50, valgrind, ddb50, strings, characters, pointers, structures, arrays, linked lists, trees, hash tables, tries, and binary search trees. Code examples are provided for swapping variables, allocating memory, defining a student struct, creating a binary search tree, and searching a binary search tree. References are included to online resources for further information on data structures.

1. This is CS50

2. CS50 IDE

3. check50
debug50
help50
printf
style50

4. valgrind

5. ddb50

7. string

8. char *

13. void swap(int a, int b)
{
int tmp = a;
a = b;
b = tmp;
}

14. void swap(int *a, int *b)
{
int tmp = *a;
*a = *b;
*b = tmp;
}

17. int main(void)
{
int *x;
int *y;
x = malloc(sizeof(int));
*x = 42;
*y = 13;
y = x;
*y = 13;
}

18. struct

22. array

23. linked list
tree
hash table
trie

24. https://cs.calvin.edu/activities/books/c++/ds/1e/

25. https://cs.calvin.edu/activities/books/c++/ds/1e/

26. string name;
string dorm;

27. typedef struct
{
string name;
string dorm;
}
student;

28. int n;

29. typedef struct node
{
int n;
}
node;

30. typedef struct node
{
int n;
node *next;
}
node;

31. typedef struct node
{
int n;
struct node *next;
}
node;

33. https://cs.calvin.edu/activities/books/c++/ds/1e/

34. int n;

35. typedef struct node
{
int n;
}
node;

36. typedef struct node
{
int n;
struct node *left;
struct node *right;
}
node;

37. bool search(int n, node *tree)
{
if (tree == NULL)
{
return false;
}
else if (n < tree->n)
{
return search(n, tree->left);
}
else if (n > tree->n)
{
return search(n, tree->right);
}
else
{
return true;
}
}

38. Figure from Lewis and Denenberg’s Data Structures & Their Algorithms.

39. This is CS50