problem in learning tree based data structures

There are too many types of tree data structure like BST,AVL-tree,red-black tree, segmented tree,treap interval tree…

In what order this data structures should be learnt they can be learnt individually or the do have some connectivity.

2 Likes

From Competitive programming point of view : Learn segment trees and BIT first . You’d hardly ever need to know the rest of them (mainly because there are for ex, maps and sets in C++(which are implemented through these data structures only))

Otherwise If you just want to learn them for your knowledge order doesn’t really matter i guess.
Hope this helps!

1 Like
//