CS301 Important Topics For Final Term

✓ AVL tree

✓ BST

✓ Parse tree

✓ Expression tree 

✓ Huffman encoding 

✓ Mathematical properties of binary tree ( MCQS)

✓ Properties of binary tree (Mcqs)

✓ Complete Binary tree 

✓ Heap ,max,insertion in a heap 

✓ Insertion into a min- heap 

✓ Build heap 

✓ PerculateDown Method 

✓ GetMin Method 

✓ BuildHeap Method 

✓ Heap sort 

✓ Disjoint set ADT 

✓ Equivalence relationship 

✓ Equivalence realtion 

✓ Union by size 

✓ Union by height 

✓ Image segment ( short) 

✓ Table and dictionaries 

✓ Operation on table ADT 

✓ Binary search 

✓ Seraching an array : BS

✓ Skip list (Mcqs) 

✓ Full 

✓ Quad node 

✓ AVL tree 

✓ Hashing

Click Below Link To Download Important Topics in PDF Format

Related Articles

Responses

Your email address will not be published. Required fields are marked *