Building a Binary Tree using std::map, std:set

Hi, can someone please explain to me how I can make use of std::map and/or std::set to create a simple binary tree?

I do not seem to understand how these 2 containers can be used to represent a binary tree because I can't help but to see that map and set act as sorted arrays/lists/hashtable.