题目描述:
二叉搜索树就是左子树的值都比根小,右子树的值都比根大
#pragma once
#include<stdio.h>
#include<assert.h>
typedef struct Node{
int value;
struct Node *left;
struct Node *right;
}Node;
Node *prev = NULL;
//保证按有序的顺序调用该函数
void NodeToDubleLink(Node *node){
node->left = prev;//node->prev=prev
if (prev != NULL){
prev->right = node;//prev->next=node
}
prev = node;
}
//中序有序
void InOrder(Node *root){
if (root != NULL){
InOrder(root->left);
//根
NodeToDubleLink(root);
InOrder(root->right);
}
}