题目链接:
https://pintia.cn/problem-sets/1120858298571182080/problems/1120858493803450368
思路来源:
https://blog.csdn.net/weixin_43821410/article/details/90480393
关键步骤:
1.关键是search函数在传参时,把当前这个节点的父亲节点记录一下;
2.及时System.exit(0);结束程序,不然还会继续运行,输出别的;
package pat树;
//ac
//思路来源
//https://blog.csdn.net/weixin_43821410/article/details/90480393
import java.util.Scanner;
public class Main10建立二叉搜索树并查找父结点 {
static int n;
static int m;
public static node insert(node root,int i) {
if(root==null) {
root=new node();
root.v=i;
return root;
}
else {
if(i>root.v) root.ri=insert(root.ri,i);
else root