If you anticipate running a particular query often, you can improve overall performance by saving the query in a special file called a(n) stored procedure.
<h3>What is meant by stored procedure?</h3>
An application that uses a relational database management system can access a subroutine known as a stored procedure. These processes are kept in the data dictionary of the database. Access control and data validation are two applications for stored processes.
A stored procedure is a collection of SQL statements that have been given a name and are kept together in a relational database management system (RDBMS) so they may be used and shared by various programs.
If you expect to run a certain query frequently, putting it in a special file known as a(n) stored procedure can enhance overall speed.
To learn more about stored procedure refer to:
brainly.com/question/13692678
#SPJ4
<span>The From: line should appear under the To: line.
</span>
Answer:
bool identicaltrees(Node* root1,Node* root2)//function of type boolean true if idenctical false if not.
{
if(root1==NULL&&root2==NULL)//both trees are null means identical.
return true;
if(roo1 && root2)
{
if(root1->data==root2->data)//condition for recursive call..
{
return (identicaltrees(root1->left,root2->right)&&identicaltrees(root1->right&&root2->right);
}
}
else
return false;
}
Explanation:
In this function it of type boolean returns true if both the trees are identical return false if not.First we are checking root node of both the trees if both are null then they are identical returning true.
If both root nodes are not null then checking their data.If data is same then recursively traversing on both trees and checking both trees.
else returning false.
