Flatten a binary tree to Linked List in CPP

[HemanthThota39]

Information about Algorithm

We are given a root of the binary tree, and the given binary tree needs to be flattened into a linked list:

Here are the rules which are followed while converting it into a linked list:

• The "linked list" should use the same TreeNode class where the right child pointer points to the next node in the list and the left child pointer is always null.

• The "linked list" should be in the same order as a [pre-order traversal] of the binary tree.

  Have you read the Contributing.md and Code of conduct

• [x] Yes

• [ ] No

Other context

This is a question asked in my coding interview

[welcome[bot]]

Thanks for opening your first issue here! Be sure to follow the issue template!

[HemanthThota39]

Hey @ming-tsai @aayushjain7 @Ashborn-SM, I am interested in working on this issue can you please assign it to me!

[JIsaacSamuel]

Hey, I think I might have a solution to this. If you stiff need the code, do add the hacktoberfest label and assign it to me:)

[ming-tsai]

Hi @JIsaacSamuel, @HemanthThota39 is working on this issue, you could open another issue and I will assign it to you.