Range Sum of BST  by using inorder
\'\'\'\n\nclass Solution {\npublic:\n    void inorder(TreeNoderoot, vector&v){\n        if(root==NULL) return ;\n        inorder(root->left,v);\n        v.push_
\'\'\'\n\nclass Solution {\npublic:\n    void inorder(TreeNode*root, vector<int>&v){\n        if(root==NULL) return ;\n        inorder(root->left,v);\n        v.push_back(root->val);\n        inorder(root->right, v);\n        \n    }\n    int rangeSumBST(TreeNode* root, int low, int high) {\n        vector<int>v;\n        inorder(root, v);\n        int sum=0;\n        for(int i=0; i<v.size();i++){\n            if(v[i]>=low  && v[i]<=high){\n               sum+=v[i]; \n            }\n        }\n        return sum;\n    }\n}; \'\'\'
[]