栗子℃（EN）

DefinitionGraphG = (V, E), where V is a set of vertices, and E is a set of edges. For some reason unknown, people usually use n for the number of vertices, and m for the number of edges. |V|=n, |E|=m An edge can not point to nowhere. It's always

Disjoint SetsDisjoint Sets is the data structure that supports the operation of adding one element (as their own set), [finding the label/canonical_name of one element in a set], and union 2 sets. It can represents data like: Set1 (people whose favorite color's green)Set2 (people whose favorite color's

ADTinsert(value)remove()isEmpty()Where value is among int, string, double, char... or objects that supports < operator. HeapUnsorted Array: O(1)* insert, O(n) removeMin (need to find min first) Unsorted Linked List: O(1) insert, O(n) removeMin Sorted Array: O(n)* insert, O(1) removeMin Sorted Linked

Hash TableA hash table has: A hash function h(k)An arraySomething that handles collisions and elseDictionary in Python is a hash table. Hash FunctionA function that maps keys from key-space to an integer bounded by array size. A hash function consists of 2 parts: Takes key and produce some

Binary Search TreeA BST (binary search tree) is a tree T such: T = {} orT = {r, TL, TR} where all nodes in TL has keys less than r, all nodes in TR has keys greater than r, and TL and TR are BSTs.// BST.h #pragma once template <typename K,

TreeA tree is an acyclic graph ( a graph that has no circle in it) Tree ADTADT: Abstract Data Type insert: add data (node) to treeremove: remove data (node) from treecreate: create empty treetraversal: iterate over data// BinaryTree.h #pragma once template <typename T> class BinaryTree { public: /*....*/ private: struct

ListsLinked List// List.h #pragma once template <typename T> class List { public: // private: class ListNode { public: T data; // a place to store data ListNode *next; // a pointer pointing to next node ListNode(T &data) : data(data), next(NULL); // a constructor that inits data with ref // and default