يا جماعة الخير اللي يقدر يساعد في الحل Represnt a dictionary by a binary search tree , from the given file each node contain a pair formed of string representing a word from dict and a list of strings each element of list represent a synonym of word -epmliment ADT to represent dict -load a dic given as file to memory -test if word present in dic -given a word found in dic , print all synonyms Find the word