算法-searching

https://zhuanlan.zhihu.com/p/93647900主要用于解决一些**元素分组**的问题。它管理一系列**不相交的集合**，并支持两种操作：

・Method put() overwrites old value with new value. ・Method get() returns null if key not present. Se

Quick-find Quick-union Weighted quick-union Rather than arbitrarily connecting the second tree to th

Hash Tables hashing functions Positive integers The most commonly used method for hashing integers i

Definition. A symbol table is a data structure for key-value pairs that supports two operations: ins

binary search tree Definition. A binary search tree (BST) is a binary tree where each node has a Com