文件名称:biSearchTree_to_sortedList
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
输入一棵二分查找树，将该二元查找树转换成一个排序的双向链表。
要求不能创建任何新的结点，只调整指针的指向。
二分查找树：root，每个节点：data、small pointer、large pointer
转换成排序的双向链表后small pointer应该指向前一个元素，larger pointer指向后一个元素-Enter a binary search tree, the two yuan search tree into a sort of two-way linked list. Requirements can not create any new node, adjust the pointers point only. Binary search tree: root, each node: data, small pointer, large pointer after converted into a doubly linked list before ordering small pointer should point to an element, after the larger pointer points to an element
要求不能创建任何新的结点，只调整指针的指向。
二分查找树：root，每个节点：data、small pointer、large pointer
转换成排序的双向链表后small pointer应该指向前一个元素，larger pointer指向后一个元素-Enter a binary search tree, the two yuan search tree into a sort of two-way linked list. Requirements can not create any new node, adjust the pointers point only. Binary search tree: root, each node: data, small pointer, large pointer after converted into a doubly linked list before ordering small pointer should point to an element, after the larger pointer points to an element
(系统自动生成,下载前可以参看下载内容)
下载文件列表
biSearchTree_to_sortedDoublyLinkedList.cpp