# Algorithms and Data Structures II

> Interactive material for Algorithms and Data Structures II: B+ trees with the lecture's insertion and deletion rules, and a visualiser that animates every split, borrow and merge.

Source: https://laszlonemes.com/university/algorithms · Author: László Nemes

Algoritmusok és adatszerkezetek II

Some data structures are much easier to understand when you watch them change. This page collects interactive material for the course, starting with B+ trees.

`Algorithms` `Data structures` `B+ tree` `Interactive`

## Topics

Open it here, or on its own page in a new tab.

- Interactive
  
  **[B+ trees: insertion, deletion and an interactive visualiser](https://laszlonemes.com/university/algorithms/b-plus-trees)**
  
  The d-degree B+ tree with the lecture’s rules – leaf and internal splits on insert, borrowing, merging and rotations on delete – and a visualiser that steps through every operation on the lecture’s example trees.