Binary search tree converted to ordered doubly linked list

http://blog.csdn.net/ljianhui/article/details/22338405

First, the problem description Enter a binary search tree, and now you want to convert the two-fork search tree into a sorted doubly linked list. And in the process of conversion, you cannot create any new nodes, only the point of the node pointer in the tree can be adjusted to implement.   Second, realize the idea in the binary search tree, each node has two pointers to its left and right subtree, and the value of the left subtree node is always less than the value of the parent node, and the value of the right subtree node is always greater than the parent node value. In a doubly linked list, each node also has two pointers, which point to the previous node and the latter node, respectively. So the nodes of the two data structures are consistent, the binary search tree is a two-fork search tree, the two-way linked list is doubly linked list, just because two pointers to different points, by changing its pointer to the direction of the implementation is completely possible.   For example, the following two-fork search tree,  If using the middle sequence traversal, its traversal order is 1-2-3-4-5-6-7, through the appropriate pointer transformation operation, can become the two-way ordered chain list as follows:   from, we can see, in order to reduce the number of pointer changes, And to make the operation simpler, when converting to a sort doubly linked list, the pointer to the left Dial hand node is adjusted to the pointer to the previous node in the list, and the pointer to the right child node is adjusted to the pointer to the next node in the list. For example, for a pointer above the value 2, after the adjustment, its previous node is 1, the latter node is 3, and the node 2 of the left Dial hand node is 1, the right child node is originally 3.  for the operation of the tree, usually in the process of traversing the various nodes of the tree, through the node implementation of certain operations to complete, This algorithm is no exception. Since the conversion of the two-way linked list is also ordered, and we can see from the above, when we traverse the binary search tree in the middle sequence, its traversal of the node is ordered, so here I take a bit of the traversal order should be the middle order.   So how do we adjust the pointer so that the two-fork search tree becomes a two-way ordered list? When traversing to the root node, we can think of the tree as three parts: the root node, the Zoki right subtree of the root. such as the two-fork sorting tree, it is divided into root node 4, the Node 2 is the root of the left dial hand pair and the node 6 is the root of the right subtree. From the list of transformations, we can see that the left pointer of node 4 points to Node 3, the right pointer of node 3 points to Node 4, and because we are using the middle sequence traversal, so when we traverse to the node 4 o'clock, the node 4 of the tree has been transformed into an ordered doubly linked list, The node 3 is the tail node of the converted doubly linked list, so we should use a variable last_node to hold the last node pointer in order to be used when it is contiguous with the root node. The value of this variable last_node is then updated to point to the root node 4. For the right sub-tree of Node 4, take similar action. As for the specific implementation, we only need to recursively place all the subtreesThis can be done. The operation process is as follows:  : implementation code   [CPP]View Plaincopyprint?

2. #include <iostream>
4. #include <stdlib.h>
6. #include <time.h>
10. Using Std::cout;
12. Using Std::cin;
14. Using Std::endl;
16. struct Bsnode
18. {
20. //Define the node structure of binary search tree
22. Bsnode *left;
24. Bsnode *right;
26. int data;
28. };
30. Define various data types to use
32. typedef bsnode* Bstree;
34. typedef bsnode* Dlist;
36. typedef bsnode Dlnode;
38. Insert a node with a value of data into a binary search tree
40. Bstree Insertnode (bstree tree, int data);
42. Turn the two-fork search tree into a doubly linked list and return to the head node.
44. Dlist bstreetolist (bstree tree);
46. Traverse the binary search tree for each node and adjust the pointer.
48. void Convertnode (Bstree tree, Bsnode **last_node);
50. Find the leftmost node of a binary search tree
52. bsnode* Findleftmostnode (bstree tree);
54. Binary search tree with middle order output
56. void Printbitree (Bstree tree);
58. Output link List
60. void Printlist (dlist list);
62. Bstree Insertnode (bstree tree, int data)
64. {
66. if (tree = = NULL)
68. {
70. //Find insertion point, insert
72. Tree = new Bsnode;
74. Tree->left = NULL;
76. Tree->right = NULL;
78. Tree->data = data;
80. }
82. //Insert in its right subtree
84. Else if (Tree->data < data)
86. Tree->right = Insertnode (tree->right, data);
88. //Insert in its left subtree
90. Else if (Tree->data > Data)
92. Tree->left = Insertnode (tree->left, data);
94. return tree;
96. }
98. Dlist bstreetolist (Bstree tree)
100. {
102. if (tree = = NULL)
104. return NULL;
106. //Find the leftmost node, the head node of the converted list
108. Dlnode *head = Findleftmostnode (tree);
110. Bsnode *last_node = NULL;
112. //To convert
114. Convertnode (tree, &last_node);
116. return head;
118. }
120. bsnode* Findleftmostnode (Bstree tree)
122. {
124. if (tree = = NULL)
126. return NULL;
128. While (tree->left! = NULL)
130. Tree = tree->left;
132. return tree;
134. }
136. void Convertnode (Bstree tree, Bsnode **last_node)
138. {
140. if (tree = = NULL)
142. return;
144. //Convert the tree's left subtree, Last_node is the pointer to the last node of the linked list after conversion
146. if (tree->left! = NULL)
148. Convertnode (Tree->left, Last_node);
150. //Adjust the left pointer of the tree to point to the previous node
152. Tree->left = *last_node;
154. //Adjustment points to the last node, right points to the next node .
156. if (*last_node! = NULL)
158. (*last_node)->right = tree;
160. //Adjust the pointer to a node in the last linked list.
162. *last_node = tree;
164. //Convert the right subtree of a tree, Last_node is a pointer to the last node of the linked list after conversion
166. if (tree->right! = NULL)
168. Convertnode (Tree->right, Last_node);
170. }
172. void Printbstree (Bstree tree)
174. {
176. if (tree = = NULL)
178. return;
180. Printbstree (Tree->left);
182. cout << tree->data << "";
184. Printbstree (Tree->right);
186. }
188. void Printlist (dlist list)
190. {
192. Dlnode *node = list;
194. While (node! = NULL)
196. {
198. cout << node->data << "";
200. node = node->right;
202. }
204. }
206. int main ()
208. {
210. Bstree tree = NULL;
212. Srand (Time (NULL));
214. cout << "Insert Data Order is:" << Endl;
216. For (int i = 0; i <; ++i)
218. {
220. //Insert random 10 numbers to generate a two-fork sort tree
222. int data = rand ()%100;
224. cout << data << "";
226. Tree = Insertnode (tree, data);
228. }
230. cout << "\nthe bstree is:" << Endl;
232. Printbstree (tree);
234. //To convert
236. Tree = bstreetolist (tree);
238. cout << "\nbitree to List:" << Endl;
240. Printlist (tree);
242. return 0;
244. }

The results are as follows: Four, code analysis because the binary sorting tree is not allowed to have the same elements, in the randomly generated 10 number, there are two of the same 3 and 73, so actually inserted into the two fork sorting tree node only 8, and then we are in the middle order to traverse the output binary sorting tree data, Then output the converted linked list of data, found that the order is consistent, thus proving the correctness of the algorithm. The core functions of the algorithm are Bstreetolist,convertnode and Findleftmostnode. As we can see in the function bstreetolist, we have a variable last_node used to record the converted list of the end nodes, because in the convention we return the 1th node of the list (counting from 1), and Last_node points to the last node, We can take the pointer from the end of the tail to get the first node pointer, but here I do not, because it needs to traverse each node once, the time complexity of O (n). Instead, a pointer to the leftmost node of the two-fork sort tree is found before the transformation. Because the sort binary tree is ordered, the leftmost node is the smallest node, and our algorithm does not delete or add nodes, that is, the address of the node is not changed, so the leftmost node is the 1th node of the converted list, its time complexity is O (logn). Five, time complexity and space complexity the algorithm starts from the root point to the left, finds the leftmost node, has a time complexity of O (Logn), and then iterates through each node in the two-fork sort tree for pointer transformation, with a time complexity of O (n), so the total time complexity is O (n). As for the spatial complexity, because the Convertnode function makes recursive calls, its function has two open parameters, and the function call layer in the function stack does not exceed the height of the tree, so its space complexity is O (logn).

Binary search tree converted to ordered doubly linked list