问在根树中插入(项)- LCRS表示

EN

/* tree.c */
#include"tree.h"

int main(){
  Tree *rootedTree = newTree();
  insert(rootedTree, "~jrs/61b");
  preOrder(rootedTree);
  printf("\n");
}

/* tree.h */
#include<stddef.h>
#include<string.h>
#include<stdio.h>
#include<stdlib.h>

typedef struct SiblingTreeNode{
  struct SiblingTreeNode *parent;
  void *item;
  struct SiblingTreeNode *firstChild;
  struct SiblingTreeNode *nextSibling;
}Node;

typedef struct LCRSTree{
  Node *root;
  int size;
}Tree;


Tree * newTree(void){
  Tree *rootedTree = malloc(sizeof(Tree));
  rootedTree->root = NULL;
  rootedTree->size = 0;
  return rootedTree;
}

void insert(Tree *rootedTree, const void *item){
  if(rootedTree->root == NULL){

    Node *rootNode = malloc(sizeof(Node));
    rootNode->parent = NULL;
    rootNode->item = malloc(sizeof(strlen((const char *)item) + 1));
    strcpy((char *)rootNode->item, (const char *)item);
    rootNode->firstChild = NULL;
    rootNode->nextSibling = NULL;

    rootedTree->root = rootNode;
    rootedTree->size = 0;
  }else{
    /*
       Who takes care of the ordering of inserting items?
       User or insert() function?
    */
  }
}

void visit(Node *node){
  printf("\n(%s)", (char *)(node->item));
}
/*
  Pre-order traversal.

  Visit each node before recursively visiting its children, left to right.
  Root visited first
*/
void preOrderTraverse(Node * node){
  visit(node);
  if(node->firstChild){
    printf("\n|");
    preOrderTraverse(node->firstChild);
  }
  if(node->nextSibling){
    printf("-->");
    preOrderTraverse(node->nextSibling);
  }
}
void preOrder(Tree *tree){
  preOrderTraverse(tree->root);
}