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??? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
