leetcode--Flatten Binary Tree to Linked List

Flatten Binary Tree to Linked List

Given a binary tree, flatten it to a linked list in-place.

For example,
Given

     1    /    2   5  / \    3   4   6

The flattened tree should look like:

   1         2             3                 4                     5                         6

There are many ways to do this, although the following is very simple, but I think it is quite classic.

C + + code:

Class Solution { Public:voidFlatten (TreeNode*Root) {if(!Rootreturn; Flatten (Root -left); Flatten (Root -right);if(nullptr==Root -Leftreturn; TreeNode*P=Root -Left while(p -right) p=P -Right P -Right=Root -Right Root -Right=Root -Left Root -Left=Nullptr }};

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

leetcode--Flatten Binary Tree to Linked List