EASWARI ENGINEERING COLLEGE

DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

PROGRAMMING AND DATA STRUCTURES USING C
Assignment – III
1. Write C program to Check if two binary trees are identical or not – Iterative and
Recursive
2. Check if a binary tree is a complete binary tree or not with the implementation of
code.
3. Find k’th smallest and k’th largest element in a BST, Consider the following BST , if
k=2, the ‘k’th smallest element is 10, and the ‘k’th largest element is 20.

                                      

4. Construct a B-Tree with order m = 3-for the key values 2, 3, 7, 9, 5, 6, 4, 8, 1 and

delete the values 4 and 6. Show the tree in performing all operations.
4.  i) Show the results of inserting 43, 11, 69, 72 and 30 into an initially empty AVL
tree.     ii) Show the-results of deleting the nodes 1l and 72 one after the other of the
constructed tree.