Question

I need help on question 12 please

An inorder tree traversal of a binary search tree produces a listing of the tree nodes in alphabetical or numerical order. Construct a binary search tree for "To be or not to be, that is the question, " and then do an inorder traversal. Construct a binary search tree for "In the high and far off times the Elephant, O Best Beloved, had no trunk, " and then do an inorder traversal.

Answer 1

The answer for the same is..

-- the and fusi oef times the Ta kina 1st 1tent , as a goat node T the can be the higk and off times 米 elephent hal n Best Beloved


elephant hed n mo Best Beloved Hesre, 'the' comes2 times. So, I considenee CL-Stule一一like then the Vculue is same as Loat sighb of hight, tde cam use it in left sub-tstee Then it would Iheve come in the uig ild of off time.s ike off instedd f the the

elep Bes Belo Tnoidet tavesiscul means Left-Root → Ri Hesne Beloved. Best ! 巳epht.nt fet ein the times trunk like

Here, as the words are given, the inorder traversal makes sure we get the words in the alphabetical order.

While inserting in the BST, just keep one thing in mind.. greater or less is defined as per the dictionary. For example, a < b < ... as well as beloved comes before best word in the dictionary so beloved < best which means if the first letter is same, we compare the second letters of both. This way I have constructed the BST.

Do comment if there is any query. Thank you. :)