月弦音

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

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

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

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,