You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Build a Graph Data Structure using adjacency list. the Graph Includes different Mtheods like add Node, addEdge, Print, DepthFirstTraversal both recursive and iterative using a stack , Breadth First search using a queue , topological sorting and hasCycle
Recursively implemented a Trie Data Structure to support various word manipulations including Autocomplete. A trie is a 26-ary tree where the root node represents an empty string “” and if the kth (k going from 0 to 25) subtree is not a null subtree, it represents a string that is the concatenation of the characters represented by the parent and…