Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

The Great Tree-List Recursion Problem.

Asked by Varun Bhatia.

Question:
Write a recursive function treeToList(Node root) that takes an ordered binary tree and rearranges the internal pointers to make a circular doubly linked list out of the tree nodes. The”previous” pointers should be stored in the “small” field and the “next” pointers should be stored in the “large” field. The list should be arranged so that the nodes are in increasing order. Return the head pointer to the new list.



This is very well explained and implemented at: Convert a Binary Tree to a Circular Doubly Link List

References:
http://cslibrary.stanford.edu/109/TreeListRecursion.html



Article Tags :
DSA
Linked List
Tree
Recommended Articles
1. Why is Tail Recursion optimization faster than normal Recursion?
2. Check if given number can be represented as sum of two great numbers
3. Secretary Problem (A Optimal Stopping Problem)
4. Transportation Problem | Set 7 ( Degeneracy in Transportation Problem )
5. Nuts & Bolts Problem (Lock & Key problem) using Quick Sort
6. Nuts & Bolts Problem (Lock & Key problem) using Hashmap
7. Difference between 0/1 Knapsack problem and Fractional Knapsack problem
8. Inorder Tree Traversal without recursion and without stack!
9. Print ancestors of a given binary tree node without recursion
10. Postorder traversal of Binary Tree without recursion and without stack
11. Leaf nodes from Preorder of a Binary Search Tree (Using Recursion)
12. Preorder Traversal of N-ary Tree Without Recursion
13. Zig-Zag traversal of a Binary Tree using Recursion
14. Find the node with minimum value in a Binary Search Tree using recursion
15. Find the node with maximum value in a Binary Search Tree using recursion
16. Find maximum and minimum element in binary tree without using recursion or stack or queue
17. Find Maximum Level Sum in Binary Tree using Recursion
18. Bottom View of a Binary Tree using Recursion
19. Product of nodes at k-th level in a tree represented as string using Recursion
20. Construct a Binary Tree in Level Order using Recursion
21. How to solve time complexity Recurrence Relations using Recursion Tree method?
22. Pre Order, Post Order and In Order traversal of a Binary Tree in one traversal | (Using recursion)
23. Inorder Tree Traversal without Recursion
24. Write a program to Calculate Size of a tree | Recursion
25. Inorder Non-threaded Binary Tree Traversal without Recursion or Stack