CS140 -- Final Exam: Q14

The following code is a typedef for a binary search tree node:

typedef struct bstreenode {
  char *key;
  Jval val;
  struct bstreenode *left;
  struct bstreenode *right;
} BstreeNode;

And the following is the typedef for a binary search tree:

typedef struct {
  BstreeNode *root;
} Bstree;

Suppose keys are character strings. Write code for:

void insert_node(Bstree *tree, char *key, Jval v);

This inserts a new node into the tree with the given key and value. You may assume that there are no nodes in the tree with the given key.

Do your answer on the answer sheet.