Channi Studies

Union, Intersection, and DifferenceIf you are familiar with set notations from your math course, than you would know all these already. The union of sets X and Y, denoted as X ∪ Y, is a set that contains every element from X, every element from Y, and no duplicates. The intersection of sets X and Y, denoted as X ∩ Y, is a set that contains every element that is in both X and Y, no duplicates. Th..

SET ADTA set is a collection of distinct elements.A set add operation adds an element to the set, provided an equal element doesn't already exist in the set. (No duplicates)Ex. The set with 3, 7, and 9 is equivalent to the set with integers 9, 3, and 7. 만약 Python의 Set에 대해서 알고 계시다면, 그것과 동일하다고 생각할 수 있겠습니다. Element Keys and RemovalSet elements may be primitive data values, such as numbers or strin..

Treap BasicsA BST built from inserts of N nodes having random-ordered keys stays well-balanced and thus has near-minimum height, meaning searches, inserts, and deletes are O(logN).Because insertion order may not be controllable, a data structure that somehow randomizes BST insertions is desirable. A treap uses a main key that maintains a binary search tree oderering property, and a secondary ke..

Priority Queue ADTA priority queue is a queue where each item has a priority, and items with higher priority are closer to the front of the queue than items with lower priority.The priority queue enqueue operation inserts an item such that the item is closer to the front thatn all items of lower priority, and closer to the end than all items of equal or higher priority.The priority queue dequeue..