114. Flatten Binary Tree to Linked List LeetCode

来源:互联网 发布:centos yum配置 编辑:程序博客网 时间:2024/06/06 12:38

题意:把二叉树变成链表。
题解:一边往下遍历一边改变树的形态。

class Solution {public:    void dfs(TreeNode* root,TreeNode* &pre)    {        if(root == NULL) return;        if(pre != NULL)            pre->left = NULL,pre->right = root;        pre = root;        TreeNode* l = root->left;        TreeNode* r = root->right;        dfs(l,pre);        dfs(r,pre);    }    void flatten(TreeNode* root) {        TreeNode* pre = NULL;        dfs(root,pre);    }};
0 0