Translate subtree to Go

The International Phonetic Alphabet (IPA) is an alphabetic system of phonetic notation based primarily on the Latin alphabet. With phonetic transcriptions, dictionarie tell you about the pronunciation of words, because the spelling of an English word does not tell you how you should pronounce it. Below is the phonetic transcription of subtree:

/səbtɹi/

subtreasurysubtreasuriessubtreasurershipsubtreasurerssubtreasurersubtreadsubtraysubtratesubtrapezoidalsubtrapezoidsubtrapsubtransverselysubtransversesubtransversallysubtransversalsubtreessubtrenchsubtriangularsubtriangularitysubtriangulatesubtribalsubtribesubtribessubtribusubtribualsubtrifidsubtrigonalsubtrihedralsubtriplicatesubtriplicated

- And look at this portion this is called a subtree and the subtree has root at c. Similarly,
- if you take this this is a subtree and this subtree has a root at b. So these are some
- than 7 will be in the left subtree. All elements greater than 7 will be in the right subtree.
- the left subtree. All the nodes on the left subtree will have values less than that. And
- will go to the right subtree, there is no right subtree here. If you have a record say
- 6 go to this subtree and all values greater than or equal to 6 goes to the right subtree.
- subtree and greater than or equal to 17 will go to the right subtree. So the discriminating
- subtree and T2 is the right subtree. So, this is the tree you are having with node labels
- order you will search the root first then the left subtree and then the right subtree.
- subtree and the right subtree. So b will be visited first then the left subtree is just
- subtree and the right subtree, there is no right subtree here so e and g. Similarly,
- subtree then the right subtree. So, for c, no left subtree and right subtree. And the
- right subtree again should be visited in the preorder manner root, first the left subtree
- nodes will be visited? First the left subtree then the root then the right subtree and the
- left subtree itself should be visited in the inorder manner, first the left subtree then
- two again should be visited in the inorder manner, left subtree root and right subtree.
- then the right subtree. And this right subtree again has to be visited in the inorder manner
- then the right subtree. And in the inorder one the left subtree is traversed first in
- a postorder left subtree, right subtree, root that is the order in which you go so you will
- the subtrees. Remember we have introduced other terms, left subtree and right subtree.