Search Results for "trees"

Binarytree is Python library that lets you generate, visualize, inspect and manipulate binary trees. Skip the tedious work of setting up test data, and dive straight into practicing algorithms. Heaps and BSTs (binary search trees) are also supported. Binarytree supports another representation which is more compact but without the indexing properties. Traverse trees using different algorithms.

Gato (Graph Animation Toolbox): Animate graph algorithms for example for computing shortest paths, minimal spanning trees, maximum flows or maximal cardinality or weight matchings. Create your own animations using the Animated Data Structures (ADS).

...The repository emphasizes a learn-by-doing approach: you read a prompt, attempt a solution, and verify behavior with tests, often within notebooks or scripts. Problems span arrays, strings, stacks, queues, linked lists, trees, graphs, dynamic programming, and more, mirroring common interview themes. Many challenges include hints and reference solutions so you can compare approaches and learn idiomatic patterns. The structure encourages incremental improvement—start with a brute-force idea, then refine to optimal time and space complexity. It serves both as a self-study path and as a warm-up bank for interview prep or coding katas.

...For simplex method, it comes with several examples including degeneracy and cycling, and allow the user to dictate how to pivot. For branch and bound method, it is desinged to interact with the user to explore all possible branch and bound trees. The user can also load a problem from a text file or simply type in a model directly. The format is very simple and very similar to the LP format, see the packed-in examples.

Graphical visualizer of the various types of binary search trees