這題不知道說點(diǎn)啥。。。
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: TreeNode* PRe; void flatten(TreeNode* root) { if(root == NULL) return ; flatten(root -> right); flatten(root -> left); root -> right = pre; root -> left = NULL; pre = root; }};新聞熱點(diǎn)
疑難解答
圖片精選
網(wǎng)友關(guān)注
