Explain threaded binary trees?


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More C Interview Questions

WHO WROTE C LANGUAGE?

4 Answers  


process by which one bit patten in to another by bit wise operation is? (a) masking, (b) pruning, (c) biting, (d) chopping,

0 Answers   InterGraph,


what is unsigened char and what is the difference from char

2 Answers  


Is the exit() function same as the return statement? Explain.

0 Answers   Agilent, ZS Associates,


How can a process change an environment variable in its caller?

0 Answers  


5. What kind of sorting is this: SORT (k,n) 1.[Loop on I Index] repeat thru step2 for i=1,2,........n-1 2.[For each pass,get small value] min=i; repeat for j=i+1 to N do { if K[j]<k[min] min=j; } temp=K[i];K[i]=K[min];K[min]=temp; 3.[Sorted Values will be returned] A)Bubble Sort B)Quick Sort C)Selection Sort D)Merge Sort

2 Answers   Accenture,


Can we declare variable anywhere in c?

0 Answers  


Why flag is used in c?

0 Answers  


What are types of functions?

0 Answers  


What is merge sort in c?

0 Answers  


c program to print a name without using semicolon

9 Answers   TCS, Wipro,


What is the full form of getch?

0 Answers  


Categories