How can you implement binary trees in a standard template library?

Standard Template Library (STL) is part of the C++ standard library. The <i>template</i> concept in C++ allows to define generic classes which may then be brought to life with concrete...

A binary tree is simply a tree in which each node can have at most two children. A binary search tree is a binary tree in which the nodes are assigned values, with the following restrictions ; -No...

no they are not same

A tree doesn't do anything so it has no speed...

It is possible, you'll have to use a structure like this: typedef struct TreeElement { struct TreeElement *left, *right; int data; } TreeElement;