Seonglae Cho[자료구조] 그림으로 알아보는 B+Tree
정렬된 순서를 보장하고, 멀티레벨 인덱싱을 통한 빠른 검색과 선형탐색까지 가능한 실전형 자료구조 B+ 트리입니다.
![[자료구조] 그림으로 알아보는 B+Tree](https://www.notion.so/image/https%3A%2F%2Fstatic.velog.io%2Ffavicons%2Fapple-icon-152x152.png?table=block&id=04d6d2b0-a2df-4dea-a206-f7d2597d5fea&cache=v2){kind=icon}
https://velog.io/@emplam27/자료구조-그림으로-알아보는-B-Plus-Tree
![[자료구조] 그림으로 알아보는 B+Tree](https://www.notion.so/image/https%3A%2F%2Fvelog.velcdn.com%2Fimages%2Femplam27%2Fpost%2F83840600-d0b5-4432-a7ec-edd519420eab%2FB%2520%25ED%2594%258C%25EB%259F%25AC%25EC%258A%25A4%2520%25ED%258A%25B8%25EB%25A6%25AC%2520%25EC%258D%25B8%25EB%2584%25A4%25EC%259D%25BC.jpg?table=block&id=04d6d2b0-a2df-4dea-a206-f7d2597d5fea&cache=v2)
B+ tree
A B+ tree is an m-ary tree with a variable but often large number of children per node. A B+ tree consists of a root, internal nodes and leaves.[1] The root may be either a leaf or a node with two or more children.
https://en.wikipedia.org/wiki/B+_tree