What is binary tree? Construct a binary tree using the inorder and postorder traversal of the node given below :
Inorder : D B F E A G C L J H K
Postorder : D F E B G L J K H C A
A binary tree consists of a finite set of element that can be partitioned into three distinct subset called root, the left and right sub tree. If there are no elements in the binary tree it is called an empty binary tree.
a) Sort the following list using the Radix Sort :
189, 205, 986, 421, 97, 192, 535, 839, 562, 674
Write a C program to find minimum among three numbers.
Write a C program to find a no. is PALINDROME or NOT.
Write the rules of DBA.
Write short notes on:
Briefly discuss about Critical Path Method (CPM)
