60       tree_node *new_node = (tree_node *)malloc(sizeof(tree_node));  in insert()  local
61       new_node->word = strdup(word);  in insert()
62       new_node->left = NULL;  in insert()
63       new_node->right = NULL;  in insert()
64       root->left = new_node;  in insert()
70       tree_node *new_node = (tree_node *)malloc(sizeof(tree_node));  in insert()  local
71       new_node->word = strdup(word);  in insert()
72       new_node->left = NULL;  in insert()
73       new_node->right = NULL;  in insert()
74       root->right = new_node;  in insert()
92         tree_node *new_node = (tree_node *)malloc(sizeof(tree_node));  in populate_dictionary()  local
93         new_node->word = new_word;  in populate_dictionary()
94         new_node->left = NULL;  in populate_dictionary()
95         new_node->right = NULL;  in populate_dictionary()
96         *dictionary = new_node;  in populate_dictionary()