지금 자료구조 알고리즘 공부 중인 학생입니다. 다름이 아니라 해시테이블 체이닝 기법 구현을 공부하는 중에 책에 적혀있는 코드 중 이해가 안가는게 있어 질문드립니다..ㅠㅠ
class Node:
    def __init__(self,key,value,next) :
        self.key = key
        self.value = value
        self.next = next
class ChainedHash :
    def __init__(self,capacity) :
        self.capacity = capacity 
        self.table = [None]*self.capacity 
    def hash_value(self,key):
        if isinstance(key,int):
            return key % self.capacity
        return (int(hashlib.sha256(str(key).encode()).hexdigest(),16)%self.capacity)
    def remove(self,key):
        hash = self.sash_value(key)
        p = self.table[hash]
        pp = None

        while p is not None:
            if p.key == key:
                if pp is None:
                    self.table[hash] = p.next
                else:
                    pp.next = p.next
                return True
            pp = p
            p = p.next
        return False


이 부분에서 밑의 remove메소드의 pp가 none값인데 어떻게 if문에서 else로 빠질 수 있는지 도통 추리가 안됩니다 ㅠㅠㅠ
너무 기초적인 부분인데 헤매니까 자괴감이 들어서 옵치킬뻔 했습니다 ㅠ