一道关于递归运用二叉查找法的JAVA题目

来源：百度知道 编辑：UC知道 时间：2024/07/01 05:00:51
我的代码为：
import java.awt.*;
import java.awt.event.*;
import javax.swing.*;

public class BinarySearchSuper extends JApplet implements ActionListener
{
JLabel enterLabel,resultLabel;
JTextField enterField,resultField;

int array[];

public void init()
{
Container container=getContentPane();
container.setLayout(new FlowLayout());
enterLabel=new JLabel("Enter integer search key");
container.add(enterLabel);

enterField=new JTextField(10);
container.add(enterField);
enterField.addActionListener(this);

resultLabel=new JLabel("Result");
container.add(resultLabel);

resultField=new JTextField(20);
resultField.setEditable(false);
container.add(resultField);

array=new int[15];

//不应该去改递归的返回值，只能在递归中找出答案
package com.image;

import java.awt.*;
import java.awt.event.*;
import javax.swing.*;

public class BinarySearchSuper extends JApplet implements ActionListener {
JLabel enterLabel, resultLabel;

JTextField enterField, resultField;

int array[];
int flag = -1;
public void init() {
Container container = getContentPane();
container.setLayout(new FlowLayout());
enterLabel = new JLabel("Enter integer search key");
container.add(enterLabel);

enterField = new JTextField(10);
container.add(enterField);
enterField.addActionListener(this);

resultLabel = new JLabel("Result");
container.add(resultLabel);

resultField = new JTextField(20);
resultField.setEditable(false);
container.add(resultField);

array = new int[15];
for (int counter = 0; counter < array.length; c