wisdompeak-lc/Tree/114.Flatten-Binary-Tree-to-Linked-List at master · rongxunwang/wisdompeak-lc

Name		Name	Last commit message	Last commit date
parent directory ..
114.Flatten Binary Tree to Linked List.cpp		114.Flatten Binary Tree to Linked List.cpp
Readme.md		Readme.md

Readme.md

用递归的思路。先各自flattern(root->left)和flattern(root->right)将左右子树分别扁平化。然后进入左子树一路向右找到最底层的节点node。将整颗右子树拼接到node->right，再把整颗左子树拼接到root->right。

最后重点，不要忘了把 root->left=NULL