Binary tree (Arboles binarios): In computer science, a binary tree is a tree data structure in which each node has at most two children. Typically the child nodes are called left and right. One common use of binary trees is binary search trees; another is binary heaps.
El codigo fuente para representar cada uno de los nodos es el siguiente
Ahora el codigo que implementa la clase IntBST (Arbol Binario), se muestran las funciones y a continuacion las mismas funciones detalladas
Insert :
Preorder, inorder, postorder :
