Explain thread, Data Structure & Algorithms


By changing the NULL lines in a binary tree to special links known as threads, it is possible to perform traversal, insertion and deletion without using either a stack or recursion. 

Posted Date: 5/11/2013 1:06:16 AM | Location : United States

Related Discussions:- Explain thread, Assignment Help, Ask Question on Explain thread, Get Answer, Expert's Help, Explain thread Discussions

Write discussion on Explain thread
Your posts are moderated
Related Questions
i need help in java recursion assignment.

write a COBOL program to find the biggest of two numbers

This unit dealt along with the methods of physically storing data in the files. The terms fields, records & files were described. The organization types were introduced. The sev

Find a minimum cost spanning arborescence rooted at r for the digraph shown below, using the final algorithm shown in class. Please show your work, and also give a final diagram wh

how to write an algorithm for unions & intersection of two linklists?

Sorting is significant application activity. Several sorting algorithms are obtainable. But, each is efficient for a specific situation or a specific kind of data. The choice of a

Q. Write down any four applications or implementation of the stack.                                     Ans. (i)       The Conversion of infix to postfix form (ii)

Implement algorithm to solve 5-1 fifth order equation given.

Write the algorithm for Binary search. Also apply this algorithm on the following data. 22, 44, 11, 88, 33, 55, 77, 66

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4