MIT -6.006（2020 spring）

Weighted graphs: Different from the unweighted graph,the weighted graph's edge is weighted . In the

Graph Defination: Directed edges are ordered edges Undirected edges are unorded edges (i.e. (u,v) an

DFS & BFS： DFS different from BFS,it solves the problem about reachability.BFS is to find the shorte

Priority Queue Interface: Keep track of many items, quickly find the most important one. Order items

Height Balance: maintain the height of the tree is $O(logn)$ AVL Tree Rotations: Change the subtree'

Binary tree: def: pointer-based data structure,it has three pointers each node. representation: node

Comparison Sort Lower Bound: Leaves$\ge$ possible outputs,height is lower bound$\Omega (logL)$,so wo

1-2:Stone Searching In a infinite reange,try to find number k Solution: We want to usebinary search,

DirectAccessArray: Any item x with key k will be stored in array index k. We can find an item in O(1

A fast set: sorted array: In this data structure, we can find the item easility by the binary resear

Permutation Sort: For each permuatation, check each whether is orded Analysis: You will try all poss

Problen session: 1-2: (a) Code: (b): 1-4： 问题描述： 我们要将一个长度为2n的链表，分为两个长度为n的部分，但同时要保证后半段链表的“公平性”，因此便有了关键

Array sequence: set_at and get_at only need $O(1)$time,but delete and insert needs linear$O(n)$time.