package test1;
import java.util.*;
public class BinarySortTree {
public class node{
int value;
node next;
public node(int value){
this.value=value;
}
public void add(node node1){
this.next=node1;
}
public void show(node node1){
if(node1==null)return;
else {
show(node1.next);
System.out.print(node1.value+" ");
}
}
}
public static void main(String [] args){
BinarySortTree n=new BinarySortTree();
Scanner sc=new Scanner(System.in);
for(int i=0;i<5;i++){
int a=sc.nextInt();
n.add(n.new node(a));
}
}
}
为什么倒数第一行里的add不能被调用啊
- 写回答
- 好问题 0 提建议
- 追加酬金
- 关注问题
- 邀请回答
-
2条回答 默认 最新
- allway2 2021-04-15 19:42关注
package intersectionarrays; import java.util.*; import intersectionarrays.OuterClass.InnerClass; public class BinarySortTree { public class node { int value; node next; public node(int value) { this.value = value; } public void add(node node1) { this.next = node1; } public void show(node node1) { if (node1 == null) return; else { show(node1.next); System.out.print(node1.value + " "); } } } public static void main(String[] args) { BinarySortTree n = new BinarySortTree(); BinarySortTree.node bn = n.new node(0); Scanner sc = new Scanner(System.in); for (int i = 0; i < 5; i++) { int a = sc.nextInt(); bn.add(n.new node(a)); } } }
本回答被题主选为最佳回答 , 对您是否有帮助呢?解决 无用评论 打赏 举报