摘要：class Solution { public: vector modes; int maxCnt = 0; int curCnt = 0; int curNum = 0; vector findMode(TreeNode* root) { if (!root) { return modes; } ... 阅读全文

摘要：/* // Definition for a Node. class Node { public: int val; vector children; Node() {} Node(int _val, vector _children) { val = _val; children = _children; } }; *... 阅读全文

摘要：Recurisve: Iteratve: 阅读全文

摘要：题目： Given an n-ary tree, return the preorder traversal of its nodes' values. For example, given a 3-ary tree: Return its preorder traversal as: [1,3,5 阅读全文