Question

I wanted to make a dictionary using BST but I did not have any Idea how to store them in the tree

struct node
   {
    char word[50];
    char meaning[256];
    struct node *left, *right;
   };

I started like that but I dont know which words to put in the left and which on the right…

Answer 1

Instead of a binary tree, you should use something like a suffix tree. BSTs are really more for “greater/less-than” relationships, which would be hard to map with words. With suffix trees your nodes are characters and branches eventually lead to leaves representing an actual word.