【phpシングルチェーン実現】面接でよく聞かれる「phpシングルチェーンはどうやって実現するのか」

実装シナリオ
php面接ではphpがどのように単一チェーンを実現するかを聞かれることが多い.
先発住所:https://shudong.wang/10239.html
以下は完全な実装案で、参考にすることができます.

//    
class node {
    //     ,                  
    public $id = 0;
    public $data = '';
    public $next = null;

    //    ,         
    public function __construct($id,$nodedata){
        $this->id = $id;
        $this->data = $nodedata;
    }
}
class singleLink {
    public $head = '';
    public $size = 0;

    public function insert($id,$value,$prenodeid = 0){
        $node = new node($id,$value);
        //   ,    
        if ($this->size == 0){
            $this->head = $node;
        } elseif ($prenodeid == 0) {
            //       ,               
            //         
            $node->next = $this->head;
            $this->head = $node;
        } else {
            //           
            $cruntnode = $this->head;
            while($cruntnode->next != null ){
                if($cruntnode->next->id == $prenodeid){
                    $node->next = $cruntnode->next;
                    $cruntnode->next = $node;
                    break;
                }
                $cruntnode = $cruntnode->next;
            }
        }
        $this->size++;
        return $this;
    }

    public function edit($id,$value){
        $flag = false;
        $current = $this->head;
        while(@$current->id !=null){
            if($current->id == $id){
                $current->data = $value;
                $flag = true; 
                break;
            } 
            $current = $current->next;
        }
        return $flag;
    }

    public function get($id=0){
        $current = $this->head;
        while(@$current->id !=null){
            if($id !=0 && $current->id==$id){
                $node = $current;
                break;
            } else {
                $node[] = array($current->id,$current->data);
            }
            $current = $current->next;
        }
        return $node;
    }

    public function sort(){
        
    }

    public function delete($id){
        $flag = false;
        $current = $this->head;
        while(@$current->id !=null){
            if($current->next->id == $id){
                $current->next = $current->next->next;
                $this->size--;
                $flag = true; 
                break;
            } 
            $current = $current->next;
        }
        return $flag;
    }

}

$linklist = new singleLink();
$linklist->insert(1,'stark');
$linklist->insert(2,'shudong.wang');
$linklist->insert(3,'rdhub.cn');
$linklist->insert(4,'haha4');
$linklist->insert(5,'haha5');
$linklist->insert(6,'haha6');
$linklist->insert(7,'haha7');

$linklist->delete(5);
$linklist->insert(8,'haha8')->insert(9,'haha9')->insert(10,'haha10')->insert(11,'haha11');
var_dump($linklist);