Showing posts with the label datastructure labShow all
Program to implement binary search on an ordered list and to compare the no. of key comparisons in different elements.
Program to implement construction of a BST, and to: a.   Insert element(s) into a non empty BST  b.   Delete element(s) from a non empty BST   c.   Search for an element in a BST   d.   Retrieve elements of the BST in a sorted order.
 Program for creation of binary search tree and counting the no. of leaves in it.
Program to create an expression tree and traverse it in Inorder.
Program for creation of binary search tree and traversing it in Pre, Post and Inorder.