insertHeap(), deleteHeap()를 구현하라. 2. 구현된 함수를 사용하여, 4, 5, 6, 3, 2, 1, 7을 차례로 삽입하라. 3. 2에서 구현된 히프에서 계속삭제를 한 결과를 출력하라.

class TreeNode { TreeNode Lchild; Object data; TreeNode Rchild; } class BirnaryTree{ public static int count; public static TreeNode createBT() { return new TreeNode(); } public boolean isEmpty(TreeNode p) { if(p == null) return true; else return false; } public void makeBT(TreeNode node, TreeNode LC, Object data, TreeNode RC) { node.Lchild = LC; node.data = data; node.Rchild = RC; } public Tree..

Test.java import java.util.Scanner; public class Test { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub Scanner scan = new Scanner(System.in); int i; System.out.println("입력:"); i=scan.nextInt(); Fibonacci fib = new Fibonacci(); System.out.println("피보나치 수열"); System.out.println("f"+ i + " : " + fib.fibR(i)); } } Fibonacci.java public class Fibonacc..

Test.java public class Test{ /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub int i=8; Fibonacci fib = new Fibonacci(); System.out.println(" 피~ " + i + " 번째 값 : " + fib.fibR(i)); } } Fibonacci.java public class Fibonacci { public int fibR(int n) { if(n