Added bounds search on Linked List
This commit is contained in:
		@@ -46,7 +46,7 @@ namespace C_.Datastructures
 | 
			
		||||
            get
 | 
			
		||||
            {
 | 
			
		||||
                //Check Range
 | 
			
		||||
                if (i >= Count) throw new System.Exception("Error! Index out of Bounds");
 | 
			
		||||
                if (i >= Count || i < 0) throw new System.Exception("Error! Index out of Bounds");
 | 
			
		||||
 | 
			
		||||
                //Return Value
 | 
			
		||||
                LinkedListNode<T>? node = Traverse(i);
 | 
			
		||||
@@ -56,7 +56,7 @@ namespace C_.Datastructures
 | 
			
		||||
            set
 | 
			
		||||
            {
 | 
			
		||||
                //Check Range
 | 
			
		||||
                if (i >= Count) throw new System.Exception("Error! Index out of Bounds");
 | 
			
		||||
                if (i >= Count || i < 0 ) throw new System.Exception("Error! Index out of Bounds");
 | 
			
		||||
 | 
			
		||||
                //Change Value
 | 
			
		||||
                LinkedListNode<T>? node = Traverse(i);
 | 
			
		||||
 
 | 
			
		||||
		Reference in New Issue
	
	Block a user