题解 | #牛群的最大高度#

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 *	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 * };
 */
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param root TreeNode类 
     * @return int整型
     */
     void Travelsal(TreeNode *cur, vector<int> &vec){
        if(cur == nullptr) return;
        vec.push_back(cur->val);
        Travelsal(cur->left, vec);
        Travelsal(cur->right,vec);
     }
    int findMaxHeight(TreeNode* root) {
        if(root == nullptr) return 0;
        vector<int> a;
        Travelsal( root, a);
        sort(a.begin(),a.end());
        return a[a.size()-1];

    }
};