ara1009 0 Newbie Poster

I am learning pascal and i can not figure out how to use the binary trees. I need to find a way to input a string into a binary tree and use recursion.

Input:string (unknown length)

Output: the word taken from the binary tree in traversal(alphabetical order)

Could someone please post the source code for this.
All help is appreciated. Hopefully i can figure out how to do it from the code.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.