Archief - [PROG][C++] binairy tree

struct TreeNode {
       int item;
       TreeNode *left;
       TreeNode *right;
};

class Tree {
      private:
             TreeNode *root;
      public:
      Tree() {
             root = NULL;
      }
      
      ~Tree() {
      }
      
      void addItem(int item) {
              if (root != NULL) addItem(root, item);
              else {
                   TreeNode *newNode = new TreeNode;
                   newNode->item = item;
                   [COLOR="Black"]root = newNode;[/COLOR]
              }
      }

      void addItem(TreeNode *position,int item) {
           if (item < position->item) {
                    if (position->left != NULL) addItem(position->left,item);
                    else {
                         TreeNode *newNode = new TreeNode;
                         newNode->item = item;
                         position->left = newNode;
                    }
           } else {
                    if (position->right != NULL) addItem(position->right,item);
                    else {
                         TreeNode *newNode = new TreeNode;
                         newNode->item = item;
                         position->right = newNode;
                    }
           }
      }

              else {
                   TreeNode *newNode = new TreeNode;
                   newNode->item = item;
[color=red]                   newNode->left = NULL;
                   newNode->right = NULL;[/color]
                   root = newNode;
              }

/* Define NULL pointer value */
#ifndef NULL
#ifdef __cplusplus
#define NULL    0
#else
#define NULL    ((void *)0)
#endif
#endif