The Great Tree-List Recursion Problem
write a recursive function to convert a BST into sorted doubly linked
list.
list.
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
node * bst(node *p,node *parent=null){
ReplyDeletenode *q=null,*prev,*next,*t;
if(p==null)
return q;
bst(p->left,parent);
t=malloc(sizeof(node));
t->prev=null;
t->next=null;
t->value=p->value;
parent=t;
if(q==null)
{q=t;
}
else{
parent->next=t;
t->prev=parent;
t->next=null;
}
bst(p->right,parent);
return q;
}
http://cslibrary.stanford.edu/109/TreeListRecursion.html#c
ReplyDelete