Method inorder

LeetCode_problems/range-sum-of-bst/Solution.py:21–27

(self,root,output)

                sum+=output[i]
        return sum
    def inorder(self,root,output):
        if root == None:
            return
        else:
            self.inorder(root.left,output)
            output.append(root.val)
            self.inorder(root.right,output)