GeeksforGeeks » C/C++ Programming Questions
inbuilt container for building a balanced BST in stl c++
(1 post)-
let say we want to build a binary search tree(BST) in a c++.
we can use a map for that.
map builts the "balanced" BST in the form of red black tree.now we want to a built a balanced BST in which we also want to modify the contents of
internal nodes while inserting a node in bst.
e.g each node has a member 'count' which is equal to number of nodes in left subtree. In this case
we need to modify internal nodes too.
In this case which inbuilt container should we used???
Reply
You must log in to post.
