摘要： 删除二叉排序树中值为k的结点用被删结点左子树最右下的结点的值代替被删结点的值，然后删去最右下的结点#include "stdafx.h"#include<iostream>using namespace std;typedef struct BSTreeNode{ int data; struct BSTreeNode *lchild,*rchild;}BSTree;int _tmain(int argc, _TCHAR* argv[]){ return 0;}void Delete(BSTree *bst,int x){ BSTree *f,*p=bst; w 阅读全文