Function solve

InterviewBit_problems/Symmetric_Traversal/Solution.cpp:21–26

The following function explains the inorder traversal of a Binary Tree , i.e. leftchild--node--right child :being its basic form.

 //The following function explains the inorder traversal of a Binary Tree , i.e.
 // leftchild--node--right child :being its basic form.
 void solve(TreeNode* A,vector<int> & result)
    { if(A==NULL) return ;//BASE CASE IS IMP. ;in return nothing as void in func header
        solve(A->left,result);
        result.push_back(A->val);
        solve(A->right,result);
 }

 //The following function shows how we can call the inorder traversal function.