All geek questions in one place

Paged binary trees and AVL trees and / or B-trees

How are binary trees built with paginated trees different from AVL trees and / or B-trees?

+4
source share
2 answers

Despite the different structure of the AVL and B-tree, as pointed out by Conrad, the use of AVL and B-tree is also different, I think. The B-tree is commonly used for indexing. The purpose of using the B-tree is to reduce disk I / O, while AVL-tree data is often completely stored in memory, and not partially in memory, partially on disk, such as the B-tree. The purpose of the AVL tree is to avoid the appearance of a tree of branches / right branches in some extreme situation providing the ideal complexity of O (logn) time when performing a search operation.

+3
source

I suggest reading great Wikipedia articles on this topic.

Very briefly:

  • AVL trees are binary search trees (i.e. binary trees used to put order on its elements). The difference is that AVL trees implement a self-balancing strategy to evenly distribute nodes to reduce maximum tree depth. Trees
  • B is a generalization of binary search trees, that is, they are no longer binary.
+1
source

Source: https://habr.com/ru/post/1308325/

More articles:


All Articles