# Node of a doubly linked list
class DLNode:
    # constructor
    def __init__(self):
        self.__data = None
        self.__next = None
        self.__previous = None
    # method for getting data field of the node
    @property
    def data(self):
        return self.__data
    # method for getting next files of the node
    @property
    def next(self):
        return self.__next
    # method for getting previous files of the node
    @property
    def previous(self):
        return self.__previous
    # method for setting data field of the node
    @data.setter
    def data(self, data):
        self.__data = data
    # method for setting next field of the node
    @next.setter
    def next(self, next):
        self.__next = next
    # method for setting next field of the node
    @previous.setter
    def previous(self, previous):
        self.__previous = previous
    # returns true if node points to the another node and vise versa
    @property
    def has_next(self):
        return self.__next != None
     # returns true if node points to the another node and vise versa
    def has_previous(self):
        return self.__next != None

63973dbe472bdf7f9d875db40d8bc1f80ac923b8
<mask token>

class DLNode:

    def __init__(self):
        self.__data = None
        self.__next = None
        self.__previous = None

    @property
    def data(self):
        return self.__data
    <mask token>
    <mask token>

    @data.setter
    def data(self, data):
        self.__data = data

    @next.setter
    def next(self, next):
        self.__next = next

    @previous.setter
    def previous(self, previous):
        self.__previous = previous

    @property
    def has_next(self):
        return self.__next != None

    def has_previous(self):
        return self.__next != None

class DLNode:

    def __init__(self):
        self.__data = None
        self.__next = None
        self.__previous = None

    @property
    def data(self):
        return self.__data

    @property
    def next(self):
        return self.__next
    <mask token>

    @data.setter
    def data(self, data):
        self.__data = data

    @next.setter
    def next(self, next):
        self.__next = next

    @previous.setter
    def previous(self, previous):
        self.__previous = previous

    @property
    def has_next(self):
        return self.__next != None

    def has_previous(self):
        return self.__next != None

class DLNode:

    def __init__(self):
        self.__data = None
        self.__next = None
        self.__previous = None

    @property
    def data(self):
        return self.__data

    @property
    def next(self):
        return self.__next

    @property
    def previous(self):
        return self.__previous

    @data.setter
    def data(self, data):
        self.__data = data

    @next.setter
    def next(self, next):
        self.__next = next

    @previous.setter
    def previous(self, previous):
        self.__previous = previous

    @property
    def has_next(self):
        return self.__next != None

    def has_previous(self):
        return self.__next != None

# Node of a doubly linked list
class DLNode:
    # constructor
    def __init__(self):
        self.__data = None
        self.__next = None
        self.__previous = None
    # method for getting data field of the node
    @property
    def data(self):
        return self.__data
    # method for getting next files of the node
    @property
    def next(self):
        return self.__next
    # method for getting previous files of the node
    @property
    def previous(self):
        return self.__previous
    # method for setting data field of the node
    @data.setter
    def data(self, data):
        self.__data = data
    # method for setting next field of the node
    @next.setter
    def next(self, next):
        self.__next = next
    # method for setting next field of the node
    @previous.setter
    def previous(self, previous):
        self.__previous = previous
    # returns true if node points to the another node and vise versa
    @property
    def has_next(self):
        return self.__next != None
     # returns true if node points to the another node and vise versa
    def has_previous(self):
        return self.__next != None
