iterative traversal of a BST
Write the iterative version of inorder,preorder and postorder traversal of a binary search tree.
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
void inorder(struct node* p)
ReplyDelete{
stack s;
do
{
while(p != NULL)
{
s.push(p);
p = p->left;
}
if(!s.empty())
{
p = s.top();
s.pop();
cout<data<right;
}
}while(!s.empty() || p != NULL);
}
void preorder(struct node* p)
{
stack s;
do
{
while(p != NULL)
{
s.push(p);
cout<data<left;
}
if(!s.empty())
{
p = s.top();
s.pop();
p = p->right;
}
}while(!s.empty() || p != NULL);
}
void postorder(struct node* p)
{
stack s;
do
{
INSERT:
while(p != NULL)
{
s.push(p);
p = p->left;
}
if(!s.empty())
{
p = s.top();
s.pop();
if(p->right == NULL)
cout<data<<endl;
else goto INSERT;
}
}while(!s.empty() || p != NULL);
}