Greetings All.\n\nOne of the usages that I need is accessing the contents of the container\nthat I am using in level order( which would mean breadth- first search\napproach for a binary tree) as compared to the default depth-first search\napproach that happens when we traverse using the default iterator for a set\nor a map, when using either the less/greater comparator function object.\n\nWould anyone know, how I can access the elements of a set or a map in a\nlevel order? I tried specifying the comparator object that I want, but\nhaving it sorted as well as getting what I want (level order access) is not\nworking out.\nFurther more, if I want all level order elements of that container(either\nset or map) maintained via a linked list for traversing, is there an easy\nway to get it done ? This would of course mean deriving a custom container\nfrom a Set and adding another pointer that points to a peer Node. I know\nthere is a _Tree template class(which is a red black tree), the class\ntemplate which is used for deriving Map and Set . Maybe I can use that\ndirectly, but I am still not sure how I can still get level order access\nusing that.\n\nThanks.