What is a B-Tree? Show how the letters A to P English alphabet can be entered into a B-tree of order 4.
B-Tree
Definition: A B-Tree of order 'm' is an “m" way tree such that
1. All leaf nodes are at the same level.
2. All leaf nodes (except the root) have at most m and at least m/2 children.
3. The number of keys is one less than the number of children for non-leaf node and at most m “1” and at least m/2 for leaf nodes.
4. The root may have as few as 2 children unless the tree is the root alone.
Example: The letters A to P English alphabet can be entered into a B-tree of order 4.
Write a C language function to find the in-order successor of the root of a binary tree.
Find the postfix notation of
( a + b * x) / ( a ! – d ) s – c * y ( show all steps ).
Describe structured analysis and structured design.
Write short notes on the following:
Write a C program to convert Centigrade temp into Farenhite temp.
Write a C program to find the roots of a quadratic equation.
Discuss about SCHEDULING
Find the time complexity of Binary Search Algorithm.
