buildtree

OUTPUT Of the Above Programm is In-Order Traversal: D B H E A F C G I want to know How the Function BUILDTREE is Working, The Problem is When we Calling the Function buildtree recursively by the expression LINE 1,HOw Compliter would be Able to Read The LINE 2 and LINE 3, After Recursive...