void insert(Key key, Value value){
        if(root==null){
            root = new Node(key, value);
            count++;
            return;
        }
        Node* current = root;
        while(true){
            if(key > current->key){
                if(current->right == null){
                    current->right = new Node(key, value);
                    count++;
                    return;
                }
                else
                    current = current->right;
            }else if(key < current->key){
				if(current->left == null){
                    current->left = new Node(key, value);
                    count++;
                    return;
                }
                else
                    current = current->left;
            }else{
                current->value = value;
                return;
            }
        }
    }

首先想到的是非递归写法，老师上课讲的递归写法很神奇，要是我肯定想不出来。
我这样写有问题吗？写得感觉有点啰嗦，老师有什么巧妙的非递归写法吗？