#include
 <iostream>
  using namespace std;//节点结构体struct BSTreeNode{       int data;       BSTreeNode* left;       BSTreeNode* right;};//父节点的左右子树的返回指针一头一尾，由flag来区分BSTreeNode* Transform(BSTreeNode* t,int flag){      if (t->left)//转左子树      {               t->left = Transform(t->left, 0);                t->left->right = t;     }       if (t->right)//转右子树     {               t->right = Transform(t->right, 1);              t->right->left = t;     }       if (flag == 0)//这是父节点的左子树，返回最右节点        {               while (t->right)                        t = t->right;           return t;       }       if (flag == 1)//这是父节点的右子树，返回最左节点        {               while (t->left)                 t = t->left;            return t;       }}void main(){  BSTreeNode* n4 = new BSTreeNode;        BSTreeNode* n6 = new BSTreeNode;        BSTreeNode* n8 = new BSTreeNode;        BSTreeNode* n10 = new BSTreeNode;       BSTreeNode* n12 = new BSTreeNode;       BSTreeNode* n14 = new BSTreeNode;       BSTreeNode* n16 = new BSTreeNode;       //构造二叉树       n4->data = 4;   n4->left = n4->right = NULL;    n8->data = 8;   n8->left = n8->right = NULL;    n12->data = 12; n12->left = n12->right = NULL;  n16->data = 16; n16->left = n16->right = NULL;  n6->data = 6;   n6->left = n4;  n6->right = n8; n14->data = 14; n14->left = n12;        n14->right = n16;       n10->data = 10; n10->left = n6; n10->right = n14;       BSTreeNode* head=Transform(n10,1);//返回最左节点  while (head->right)//向右输出检验 {               cout << head->data << ' ' ;             head = head->right;     }       cout << head->data;//最右节点的data        cout << endl;   while (head->left)//向左输出检验  {               cout << head->data << ' ';              head = head->left;      }       cout << head->data;//最左节点的data        cout << endl;   system("pause");}
 </iostream>//源代码片段来自云代码http://yuncode.net
                        

回复 "二元查找树转化成排序的双向链表"

这儿你可以回复上面这条便签

作者你的名字是？

标题给你的便签一个标题。

语言你的便签是以

你的便签在这儿输入便签内容

#include
 <iostream>
  using namespace std;//节点结构体struct BSTreeNode{	int data;	BSTreeNode* left;	BSTreeNode* right;};//父节点的左右子树的返回指针一头一尾，由flag来区分BSTreeNode* Transform(BSTreeNode* t,int flag){	if (t->left)//转左子树	{		t->left = Transform(t->left, 0);		t->left->right = t;	}	if (t->right)//转右子树	{		t->right = Transform(t->right, 1);		t->right->left = t;	}	if (flag == 0)//这是父节点的左子树，返回最右节点	{		while (t->right)			t = t->right;		return t;	}	if (flag == 1)//这是父节点的右子树，返回最左节点	{		while (t->left)			t = t->left;		return t;	}}void main(){	BSTreeNode* n4 = new BSTreeNode;	BSTreeNode* n6 = new BSTreeNode;	BSTreeNode* n8 = new BSTreeNode;	BSTreeNode* n10 = new BSTreeNode;	BSTreeNode* n12 = new BSTreeNode;	BSTreeNode* n14 = new BSTreeNode;	BSTreeNode* n16 = new BSTreeNode;	//构造二叉树	n4->data = 4;	n4->left = n4->right = NULL; 	n8->data = 8;	n8->left = n8->right = NULL; 	n12->data = 12;	n12->left = n12->right = NULL;	n16->data = 16;	n16->left = n16->right = NULL; 	n6->data = 6;	n6->left = n4;	n6->right = n8;	n14->data = 14;	n14->left = n12;	n14->right = n16;	n10->data = 10;	n10->left = n6;	n10->right = n14;	BSTreeNode* head=Transform(n10,1);//返回最左节点	while (head->right)//向右输出检验	{		cout << head->data << ' ' ;		head = head->right;	}	cout << head->data;//最右节点的data	cout << endl;	while (head->left)//向左输出检验	{		cout << head->data << ' ';		head = head->left;	}	cout << head->data;//最左节点的data	cout << endl;	system("pause");}
 </iostream>//源代码片段来自云代码http://yuncode.net

创建短链接创建一个较短的URL，连接到这个便签

私人私人便签不会显示在最近列表中

保存期限我们应该什么时候删除这张便签？

防滥用键入这些字符

Code666 (代码贴、代码片段)

[Java] 二元查找树转化成排序的双向链表 →→→→→进入此内容的聊天室

回复 "二元查找树转化成排序的双向链表"