Java--二叉搜索树2（K-V模型）

二叉搜索树(K-V)

1.K-V模型

import java.util.HashSet;
import java.util.Set;

public class MyTreeMap {
   
    public static class MyEntry {
   
        private int key;
        private int value;
        private MyEntry left;
        private MyEntry right;

        public MyEntry(int key, int value) {
   
            this.key = key;
            this.value = value;
        }

        public int getKey() {
    //返回MyEntry中的key
            return key;
        }

        public int getValue() {
    //返回MyEntry中的value
            return value;
        }
    }

    private MyEntry root = null;

    public int get(int key) {
    //返回k对应的value
        MyEntry cur = root;
        while (cur != null) {
   
            if (key == cur.key) {
   
                return cur.value;
            } else if (key < cur.key) {
   
                cur = cur.left;
            } else {
   
                cur = cur.right;
            }
        }

        return -1; //未找到 返回-1
    }

    public int getOrDefault