Data-Structures.
1. Trees
- Basic Functions Header File.
- Inorder Iterative
- Number of Full Nodes.
- Height of a Tree.
- Is Given Tree a BST ?
- Are Two Trees Isomorphic ?
- Number of Leaf Nodes.
- Least Common Ancestor.
- Sum of Left Sub-Tree.
- Sum of Right Sub-Tree.
- Sum of Left Leaf Nodes.
- Path with Maximum Sum.
- Print the Mirror of the Tree.
- Print Nodes At Distance K from Root.
- Zig Zag Traversal
- Vertical Sum of Nodes.
- Kth Largest Element in a BST.
- Second Largest Element in a BST.
- Odd Even Level Difference
- Boundary Traversal Iterative
- Boundary Traversal Recursive
- Populate Right Pointers
- Shortest Leaf Path.
- Boundary Traversal Recursive
- Boundary Traversal Iterative
- Nodes at a Distance D from Target Node
- Build Segment Tree.
- BTree Node Structure.
- BTree Basic Functions Template.
- Implementation of Radix Tree.
2. Graphs
- Intro.
- BFS Traversal
- DFS Traversal
- Weighted Graph
- No of Ways to reach From Source to Destination
- Remove Nodes Less than K
3. Linked Lists
- Basic Linked List Function Header File.
- Swap Pairs.
- Difference in Two Linked Lists.
- Detect and Remove Loop.
- Reverse a Linked List.
- Remove Node without Head Pointer.
- Reverse First K Nodes.
- Even Odd Nodes.
- Skip List.
- Delete Key.
- Sum of 0's Nodes.
- Palindrome or Not.
- Reverse K Node Pairs.
- Add Two Lists.
4. Trie
- Basic Trie Template.
- Search Word in a Trie.
- Count Frequency of Words.
- Count Number of Words with given Prefix.
- Replace String
