What are the differences between segment trees, interval trees, binary indexed trees and range trees?
By : Akhil Vyshakh M T
Date : March 29 2020, 07:55 AM
this one helps. All these data structures are used for solving different problems: Segment tree stores intervals, and optimized for "which of these intervals contains a given point" queries. Interval tree stores intervals as well, but optimized for "which of these intervals overlap with a given interval" queries. It can also be used for point queries  similar to segment tree. Range tree stores points, and optimized for "which points fall within a given interval" queries. Binary indexed tree stores itemscount per index, and optimized for "how many items are there between index m and n" queries.

transforming trees in lisp
By : Tigerfish48
Date : March 29 2020, 07:55 AM

Transforming a list of structs with parent IDs into a list of trees
By : Clément Polito
Date : November 28 2020, 03:01 PM

Paged binary trees vs. AVL trees and/or Btrees
By : user3870335
Date : March 29 2020, 07:55 AM
I hope this helps you . In spite of the different structure of AVL and Btree as stated by Konrad, usage of AVL and Btree is also different, I think. Btree generally used to implement indexing. Purpose of employing Btree is to reduce disk I/O, while data of AVLtree often resists totally in memory instead of partially in memory partially on disk like Btree. Purpose of AVLtree is to avoid the appearance of left/right branch tree in some extreme situation ensuring a perfect O(logn) time complexity when doing search operation.

Minimum and maximum height of binary search trees, 234 trees and B trees
By : user3874833
Date : March 29 2020, 07:55 AM
will help you Minimal and Maximal height of a 24 tree For maximal height of a 24 tree, we will be having one key per node, hence it will behave like a Binary Search Tree.

