#include <string>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
#define COLOR_RED 0
#define COLOR_BLACK 1
typedef int keyType;
// 定义而二叉树节点数据结构
struct BinaryTreeNode {
keyType key;
string cart;
int color;
BinaryTreeNode* parent; // 保存父节点
BinaryTreeNode* left; // left child
BinaryTreeNode* right; // right child
};
// define red-black tree node
typedef BinaryTreeNode rbnode;
// define red-black tree
typedef BinaryTreeNode rbtree;
int rbt_insert(rbtree * tree, keyType key, string & cart) {
tree = (rbtree*)malloc((sizeof(rbnode)));
tree->key = key;
tree->cart = cart; //-------------------为什么这一句有问题呢???
tree->color = COLOR_BLACK;
tree->parent = tree->left = tree->right = NULL;
return 1;
}
int main(){
string nametemp;
cin >> nametemp;
rbtree * tree = NULL;
rbt_insert(tree, 1, nametemp);
return 0;
}
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
#define COLOR_RED 0
#define COLOR_BLACK 1
typedef int keyType;
// 定义而二叉树节点数据结构
struct BinaryTreeNode {
keyType key;
string cart;
int color;
BinaryTreeNode* parent; // 保存父节点
BinaryTreeNode* left; // left child
BinaryTreeNode* right; // right child
};
// define red-black tree node
typedef BinaryTreeNode rbnode;
// define red-black tree
typedef BinaryTreeNode rbtree;
int rbt_insert(rbtree * tree, keyType key, string & cart) {
tree = (rbtree*)malloc((sizeof(rbnode)));
tree->key = key;
tree->cart = cart; //-------------------为什么这一句有问题呢???
tree->color = COLOR_BLACK;
tree->parent = tree->left = tree->right = NULL;
return 1;
}
int main(){
string nametemp;
cin >> nametemp;
rbtree * tree = NULL;
rbt_insert(tree, 1, nametemp);
return 0;
}