CODEWITHSUNDEEP
c++
MoNo
MoNo

Reputation: 407

All Sub Trees of a multiset

I'm currently exploring std::set and std::multiset. I know that they are binary trees, But I was wondering if its possible to access the sub tree of a node which is sorted in set or multiset. For example, suppose that I have inserted (1,3,6,4,7,8,10,14,13) in a set and it looks like this:

enter image description here

Is it possible to find the sub tree of 3 which is 3,1,4,6,7?

Upvotes: 1

Views: 167

Answers (1)

Tony Delroy
Tony Delroy

Reputation: 106196

No, it's not possible - the Standard Library doesn't specify any functions in the std::set or std::multiset APIs that give any indication of the internal node layout.

Upvotes: 2

Related Questions