二叉树数据结构课程设计报告

广西科技大学课程设计报告课程名称《数据结构》学院计算机科学与通信工程学院专业软件工程班级软件181班学号姓名冯孔丽成绩学期 2019-2020-1 指导教师1课题：.将学生信息以学号为关键字存储在二叉搜索树中，然后按照学号查询和删除指定学生的信息。

2设计要求：（1）从键盘输入学生的学号、姓名、英语和数学成绩，计算每个学生的成绩总分，存储在二叉排序树中。

（2）按照输入的学号查询指定的学生信息，若找到，则输出找到的学生信息，否则输出“查找失败”提示信息。

（3）按照输入的学号删除指定的学生信息，若二叉排序树中存储指定学号的学生信息，则删除此学生信息，否则，输出“删除失败”提示信息。

3 程序设计（1）数据设计：二叉搜索树（2）编码○1Main.javapackage com.gkd;import com.binaryNode.BinaryNode;import com.binaryTree.BinaryTree;import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner scanner = new Scanner(System.in);BinaryTree binarytree=new BinaryTree();boolean iscontinue=true;while(iscontinue) {printOperate();int userInput=scanner.nextInt();switch(userInput) {case 1:System.out.println("请输入学生的学号："); int stuNumber = scanner.nextInt();System.out.println("请输入学生的姓名："); String stuName = scanner.next();System.out.println("请输入学生的数学成绩：");double math=scanner.nextDouble();System.out.println("请输入学生的英语成绩：");double english=scanner.nextDouble(); binarytree.insertNode(stuNumber,stuName,math,english); System.out.println("目前学生人数为："+binarytree.getNodeAmount());break;case 2:System.out.println("你要删除哪位学生的信息（请输入该学生的学号）");int deleteKey = scanner.nextInt();booleanisDeleteNode=binarytree.removeNode(deleteKey);if (isDeleteNode){System.out.println("成功删除学生信息");}else {System.out.println("删除学生信息失败");}break;case 3:System.out.println("请输入你要查询学生的学号");int key = scanner.nextInt();BinaryNode node=binarytree.find(key); if(node==null){break;}System.out.println(node);break;case 4:System.out.println("您已退出学生信息管理系统退出系统");iscontinue=false;break;case 5:binarytree.traversal();break;default:System.out.println("请输入正确数字!"); break;}}}public static void printOperate(){System.out.println("************************"); System.out.println("* 请输入操作 *"); System.out.println("* 1:存储学生信息 *"); System.out.println("* 2:删除学生信息 *"); System.out.println("* 3:查询学生信息 *"); System.out.println("* 4:退出系统 *"); System.out.println("* 5:查找所有学生信息 *"); System.out.println("************************"); }}○2BinaryTree.javapackage com.binaryTree;import com.binaryNode.BinaryNode;public class BinaryTree{private BinaryNode root;//根节点的引用private int nodeAmount;//二叉树节点数量public BinaryTree() {}private BinaryNode find(int stuNumber,BinaryNode node) {if (node == null) {return null;}if (stuNumber<node.getStuNumber()) {return find(stuNumber,node.getLeftChild()); }else if (stuNumber>node.getStuNumber()) {return find(stuNumber,node.getRightChild()); }else {return node;}}public BinaryNode find(int stuNumber) {return find(stuNumber, root);}public boolean insertNode(int stuNumber,String stuName, double math, double english){if(root==null){root = newBinaryNode(stuNumber,stuName,math,english);root.setParent(null);nodeAmount++;return true;}BinaryNode currentNode = root;//当前节点BinaryNode insertedNode = root;while(currentNode!=null){if(stuNumber==currentNode.getStuNumber()){ System.out.println("已有该学号");return false;}insertedNode = currentNode;if(stuNumber<currentNode.getStuNumber()){currentNode=currentNode.getLeftChild();}else{currentNode=currentNode.getRightChild();}}BinaryNode newNode=newBinaryNode(stuNumber,stuName,math,english);if(stuNumber<insertedNode.getStuNumber()){insertedNode.setLeftChild(newNode);newNode.setParent(insertedNode);}else{insertedNode.setRightChild( newNode);newNode.setParent(insertedNode);}nodeAmount++;return true;}public boolean removeNode(int stuNumber){BinaryNode node = find(stuNumber);if(node==null){System.out.println("你未成功删除该学生的信息，没有该学生");return false;}if(node.getStuNumber()==root.getStuNumber()){ if(node.getLeftChild() == null && node.getRightChild()== null){root = null;nodeAmount--;return true;}if(node.getLeftChild()!=null &&node.getRightChild()!=null){BinaryNode minNode = findMin(node.getRightChild()); minNode.getParent().setLeftChild(minNode.getRightChild());if (minNode.getRightChild()!=null){minNode.getRightChild().setParent(minNode.getParent()); }minNode.setLeftChild(node.getLeftChild());node.getLeftChild().setParent(minNode);minNode.setRightChild(node.getRightChild());node.getRightChild().setParent(minNode); root = minNode;nodeAmount--;return true;}if (node.getLeftChild()!=null) {root = node.getLeftChild();}else{root = node.getRightChild();}nodeAmount--;return true;}BinaryNode nodeParent =node.getParent(); if(node.getLeftChild()==null&& node.getRightChild()==null){if(node.getStuNumber()<nodeParent.getStuNumber()){nodeParent.setLeftChild(null);}else{nodeParent.setRightChild(null);}nodeAmount--;return true;}if(node.getLeftChild()!=null &&node.getRightChild()!=null){BinaryNode minNode =findMin(node.getRightChild());if(node.getRightChild()==minNode) {minNode.setLeftChild(node.getLeftChild());node.getLeftChild().setParent(minNode); }else{minNode.getParent().setLeftChild(minNode.getRightChild( ));if(minNode.getRightChild()!=null) {minNode.getRightChild().setParent(minNode.getParent()); }minNode.setLeftChild(node.getLeftChild());node.getLeftChild().setParent(minNode); minNode.setRightChild(node.getRightChild());node.getRightChild().setParent(minNode);}if(node.getStuNumber()<nodeParent.getStuNumber()){nodeParent.setLeftChild(minNode);minNode.setParent(nodeParent);}else{nodeParent.setRightChild(minNode);minNode.setParent(nodeParent);}nodeAmount--;return true;}if (node.getLeftChild()!=null) {BinaryNode nodeChild = node.getLeftChild();if(node.getStuNumber()<nodeParent.getStuNumber()){ nodeParent.setLeftChild(nodeChild);nodeChild.setParent(nodeParent);}else{nodeParent.setRightChild(nodeChild);nodeChild.setParent(nodeParent);}}else{BinaryNode nodeChild =node.getRightChild();if(node.getStuNumber()<nodeParent.getStuNumber()){nodeParent.setLeftChild(nodeChild);nodeChild.setParent(nodeParent);}else{nodeParent.setRightChild(nodeChild);nodeChild.setParent(nodeParent);}}System.out.println("你已成功删除该学生的信息");nodeAmount--;return true;}private BinaryNode findMin(BinaryNode Node) {while(Node.getLeftChild() != null) {Node = Node.getLeftChild();}return Node;}public void traversal() {System.out.println("查找所有学生信息：");inOrderTraversal(root);}public void inOrderTraversal(BinaryNode root) { if(root == null) {return ;}System.out.println(root);inOrderTraversal(root.getLeftChild());inOrderTraversal(root.getRightChild());}public int getNodeAmount() {return nodeAmount;}}○3BinaryNode.javapackage com.binaryNode;public class BinaryNode{private double math;//数学成绩private double english;//英语成绩private double totalPoints;private int stuNumber;//学号private String stuName;//姓名private BinaryNode leftChild;private BinaryNode rightChild;private BinaryNode parent;public BinaryNode() {}public BinaryNode(int stuNumber, String stuName,double math, double english) {this.stuNumber = stuNumber;this.stuName = stuName;this.math = math;this.english = english;this.totalPoints = math+english;}public double getMath() {return math;}public void setMath(double math) {this.math = math;}public double getEnglish() {return english;}public void setEnglish(double english) {this.english = english;}public double getTotalPoints() {return totalPoints;}public void setTotalPoints(double totalPoints) { this.totalPoints = totalPoints;}public int getStuNumber() {return stuNumber;}public void setStuNumber(int stuNumber) {this.stuNumber = stuNumber;}public String getStuName() {return stuName;}public void setStuName(String stuName) {this.stuName = stuName;}public BinaryNode getLeftChild() {return leftChild;}public void setLeftChild(BinaryNode leftChild) {this.leftChild = leftChild;}public BinaryNode getRightChild() {return rightChild;}public void setRightChild(BinaryNode rightChild) { this.rightChild = rightChild;}public BinaryNode getParent() {return parent;}public void setParent(BinaryNode parent) {this.parent = parent;}@Overridepublic String toString() {return"[学号=" + stuNumber +", 姓名=" + stuName +",数学分数=" + math +", 英语分数=" + english +", 总分=" + totalPoints +']';}}（3）测试①插入功能模块的数据输入及结果（可以用程序运行结果的截图）②删除功能模块的数据输入及结果。