from queue and stack classes by Hanan Kavitz
Implementation of doubly linked list, stack and queue

Node<handle
classdef Node<handle
    %Node class for doubly linked list 
    
    properties
        next
        previous
        data
    end
    
    methods
        function node=Node(newData)
           node.data=newData; 
        end
        % set and get methods.
        function set.next(node,next)
            node.next=next;
        end
        
        function node=get.next(node)
            node=node.next;
        end
        
        function set.data(node,newData)
            node.data=newData;
        end
        
        function value=get.data(node)
            value=node.data;
        end
        
        function set.previous(node,prev)
            node.previous=prev;
        end
        
        function node=get.previous(node)
            node=node.previous;
        end
    end
    
end

Contact us