Ok basically i have this:
could some1 help me a little with basic binary trees... sorting, deleting. Ive looked some up and they havnt helped. (Edit was for a tab then enter... I hate that tab moves straight to post =\ )Code:struct Node { int value; Node *left; Node *right; }; void Insert(Node *BTree, int temp) { if (BTree->value == NULL) BTree->value = temp; else if (temp < BTree->value) Insert(BTree->left, temp); else Insert(BTree->right, temp); }