Knowsh.com

Depth First and Breadth First Search in Graph

Implementation of Depth First and Breadth First Search in Graph using C# and ASP.NET.

http://www.knowsh.com/Notes/220342/Implementation-Of-Depth-First-And-Breadth-First-Search

Advertisements
Knowsh.com

Implementation of Binary Search Tree

Coding Implementation of Binary Search Tree, Insertion of node in Binary Search Tree, Deletion of node in Binary Search Tree, InOrder Traversing, PreOrder Traversing and PostOrder Traversing. Code implemented in C#

http://www.knowsh.com/Notes/220341/Coding-Implementation-Of-Binary-Search-Tree

Knowsh.com

Remove duplicates from an unsorted linked list without using temporary buffer

http://www.knowsh.com

Write Code to remove duplicates from an unsorted linked list. How would you solve this problem if a temporary buffer is not allowed?

Following program is to remove all duplicate nodes from the linked list, strickly without using any extra data structure or temporary buffer. Language used C#.

http://www.knowsh.com/Notes/220335/Remove-Duplicates-From-An-Unsorted-Linked-List-Without-Using-Temporary-Buffer