Advanced Data Structure and Miscellaneous topics
This page will contain some of the advanced Data Structures and algorithms like B-tree, AVL Tree, Augmentation, String Matching, Sorting in linear time and Randomized Algorithms.
Advanced Data Structure and Miscellaneous topics
Augmenting data structure : Adding some extra information to the existing data structure so that the data structure can be implemented efficiently. For example, typically any node of a tree contains some useful information such as a left pointer, right pointer, data, parent node, the color of the node. This information is useful for accessing particular node more efficiently from the given tree.
Important linear time sorting algorithms : Counting Sort, Radix Sort and Bucket Sort
Impotant advanced data structures to learn:
- Trie
- AVL Tree
- B - Tree
- Segment Tree
Important string matching algorithms: KMP and Rabin-Karp Algorithms
Randomized algorithm is a technique that uses a source of randomness as part of its logic.
Concepts and Problems - Advanced Data Structure and Miscellaneous topics
| # | Title |
|---|---|
1. | B - Tree Properties and Operations ( Insertion and Deletion) |
2. | AVL Tree properties and Operations (Insertion and Deletion) |
3. | Data Structure Augmentation |
4. | Trie : Structure, Properties and Operations |
5. | Sorting in linear time |
6. | String Matching Algorithms |
7. | Randomized Algorithms |