Assignment 3
Marks:30
All answers need to be in one pdf.
BINARY TREE
1. Implement Binary Tree using Array
2. Implement Binary Tree using Linked List
 Create function to perform inorder, preorder and postorder traversal of the
tree
BINARY SEARCH TREE
1. Implement Binary Search Tree using Linked List
 Insert node in the BST
 Search for a particular element in the BST
 Delete a node from BST
a) Delete leaf node
b) Delete non leaf node
c) Delete root node
HEAP
1. Implement Max Heap in C using array
2. Implement Min Heap in C using array