Open to Contribution || Hacktoberfest-accepted || Any Tech Stack ||
Language C++ Computer Graphics - (SEM-4) - Line Drawing Algorithm (DDA and Bresenham), Bresenham circle drawing, Polygon filling, 2D transformation, Cohen Sutherland polygon clipping and Bezier curve.
Data Structure Concepts (SEM-3) - Linked List, Stack, Queue, Circular Queue, Binary Tree, Binary Search Tree, Expression Tree, Threaded Binary Tree, and Heap Sort
Trie is a tree-based data structure, which is used for efficient retrieval of a key in a large dataset of strings.
Add a description, image, and links to the aarti-rathi topic page so that developers can more easily learn about it.
To associate your repository with the aarti-rathi topic, visit your repo's landing page and select "manage topics."