pheonix-001 / hacktoberfest_2022 Goto Github PK

Given the root of a binary tree, flatten the tree 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.

Create a Contributors file that contains information(name/id) of all contributors.

I would like to add famous trapping rainwater problem along with its detailed implementation and demo .Please assign this issue to me.

Add all Contributors information in Readme file in bottom section.
Thank U

I would like to add the famous Rotting Oranges problem along with its detailed implementation and demo. Please assign this issue to me.

upload your source code with proper comments

Flatten Binary Tree to Linked List

Mention your github profile

Please assign this to me under the hacktoberfest tag.

Please assign it to me under hacktoberfest tag or hacktoberfest-accepted tag.