CareerCup

Btw, map is a pair , one being key and other being value . It is an abstract data type whose implemntation varies from hash function to tree(BST)
Map can be implemented using hash function to find memory index , providing constant time lookups for value of a key. Or it can also be implemented using a special kind of tree BST for lgn time look ups.

However tree is concrete data structure having a node and children . It has different form regarding different use cases.

Tree will store elements in an order. Map does not.

tree

root
	   /    \
         /      \
        /        \
       /          \
node1           node2
      / \              /\
     /   \            /  \
    /     \          /    \
cond...

if you notice here nodes are trees too. the data structure may look something like

t: v [t[1], ..., t[k]]// t is tree, v is the value of the node, t[n] are childs

Map: are just key value pair.

key1 | value1
key2 |value 2

Tree stores elements in sorted order.
Map stores key value pair and not in any sorted order.

in c++ , map is internally stored as a balanced tree.so map is also eventually a tree but a balanced one. which is why it takes O(logn) to search in map.

The difference is that map is an "associative container" and it needs two abstract types Key/Value while tree is not an "associative container" and needs only one type Node with certain attributes/methods.