Skip to content

Add "Flatten binary tree to linked list algorithm" #9694

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Closed
Arunsiva003 opened this issue Oct 4, 2023 · 0 comments · Fixed by #9695
Closed

Add "Flatten binary tree to linked list algorithm" #9694

Arunsiva003 opened this issue Oct 4, 2023 · 0 comments · Fixed by #9695
Labels
enhancement This PR modified some existing files

Comments

@Arunsiva003
Copy link
Contributor

Feature description

The "Flatten Binary Tree to Linked List" algorithm transforms a binary tree into a singly linked list where each node's left child is null, and the right child points to the next node in the flattened sequence. This is achieved by rearranging the tree's structure in a specific way.
@Arunsiva003 Arunsiva003 added the enhancement This PR modified some existing files label Oct 4, 2023
@Arunsiva003 Arunsiva003 mentioned this issue Oct 4, 2023
Merged
14 tasks
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement This PR modified some existing files
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

Arunsiva003 patch 1 flatten tree Arunsiva003/Python
1 participant
@Arunsiva003