mkaune Goto Github PK

fima

github-slideshow

A robot powered training repository :robot:

image-similarity

numerical-m.

pa01_binarytree_ds

In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child

pa02_maxheap_ds

In computer science, a heap is a specialized tree-based data structure which is essentially an almost complete[1] tree that satisfies the heap property: in a max heap, for any given node C, if P is a parent node of C, then the key (the value) of P is greater than or equal to the key of C.

pa03

Topological sorting

pa04_unionfind_ds

In computer science, a disjoint-set data structure (also called a union–find data structure or merge–find set) is a data structure that tracks a set of elements partitioned into a number of disjoint (non-overlapping) subsets. It provides near-constant-time operations (bounded by the inverse Ackermann function) to add new sets, to merge existing sets, and to determine whether elements are in the same set. In addition to many other uses (see the Applications section), disjoint-sets play a key role in Kruskal's algorithm for finding the minimum spanning tree of a graph.

pa05_avl_ds

AVL tree is a self-balancing binary search tree. It was the first such data structure to be invented. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property.

project_virussim

pythonformachinel

talks

triangulierung

web_development