78 lines
1.2 KiB
C++
78 lines
1.2 KiB
C++
/* btree.cpp
|
|
* Date: 2021-11-22
|
|
* Author: Aryadev Chavali
|
|
*/
|
|
|
|
#include <iostream>
|
|
|
|
enum Order
|
|
{
|
|
LT,
|
|
GT,
|
|
EQ
|
|
};
|
|
|
|
template <typename T>
|
|
struct BinaryTree
|
|
{
|
|
T value;
|
|
BinaryTree<T> *left, *right;
|
|
enum Order (*compare)(T, T);
|
|
~BinaryTree()
|
|
{
|
|
delete left;
|
|
delete right;
|
|
}
|
|
};
|
|
|
|
template <typename T>
|
|
BinaryTree<T> *insert(BinaryTree<T> *tree, T value)
|
|
{
|
|
BinaryTree<T> **node = &tree;
|
|
switch (tree->compare(value, tree->value))
|
|
{
|
|
case LT:
|
|
node = &tree->left;
|
|
break;
|
|
case EQ:
|
|
case GT:
|
|
node = &tree->right;
|
|
break;
|
|
}
|
|
|
|
if (*node)
|
|
{
|
|
*node = insert(*node, value);
|
|
return tree;
|
|
}
|
|
*node = new BinaryTree<T>;
|
|
(*node)->value = value;
|
|
(*node)->left = (*node)->right = nullptr;
|
|
(*node)->compare = tree->compare;
|
|
return tree;
|
|
}
|
|
|
|
int main(void)
|
|
{
|
|
auto tree = new BinaryTree<int>;
|
|
tree->value = 5;
|
|
tree->compare = [](int x, int y)
|
|
{
|
|
if (x < y)
|
|
return LT;
|
|
else if (x > y)
|
|
return GT;
|
|
else
|
|
return EQ;
|
|
};
|
|
|
|
for (int i = 0; i <= 5; ++i)
|
|
tree = insert(tree, i * 2);
|
|
|
|
std::cout << tree->left->value << ", "
|
|
<< tree->value << ", "
|
|
<< tree->right->value << std::endl;
|
|
delete tree;
|
|
return 0;
|
|
}
|