1.知识储备:
2.代码实现:
package Tree;
public class binaryTree<key extends Comparable<key>,value > {
//记录根节点
private Node root;
//记录元素个数
private int N=0;
//构造方法,初始化二叉树
public binaryTree(key key,value value,Node left,Node right) {
// TODO Auto-generated constructor stub
this.root=new Node(key, value, left, right);
this.N=1;
}
public binaryTree() {
// TODO Auto-generated constructor stub
}
private class Node{
//存储键
public key key;
//存储值
public value value;
//存储左节点
public Node left;
//存储右节点
public Node right;
//构造方法
public Node(key key,value value,Node left,