class Solution {public:    vector
     
       modes;    int maxCnt = 0;    int curCnt = 0;    int curNum = 0;    vector
      
        findMode(TreeNode* root) {       if (!root) {          return modes;       }       curNum = root->val;        inOrder(root);               return modes;    }        void inOrder(TreeNode* root) {        if (!root) {            return;        }                inOrder(root->left);                if (root->val == curNum) {            curCnt++;        } else {            curCnt = 1;            curNum = root->val;        }                if (curCnt > maxCnt) {            // clear all number that have less occurred times            modes = {};            modes.push_back(curNum);            maxCnt = curCnt;        } else if (curCnt == maxCnt) {            modes.push_back(curNum);        }          inOrder(root->right);    }};