Explain thread, Data Structure & Algorithms

Thread

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
Area Subdivision Method In this method, the viewport is examined for clear decisions on the polygons situated in it, in regard to their overlap and visibility to the viewer. Fo

what is far and near procedures in system programming?

Maximum numbers of nodes a binary tree of depth d The maximum numbers of nodes a binary tree of depth d can have is 2 d+1 -1.

Define neotaxonomy. Discuss how electron microscopy can help in solving a zoological problem faced by taxonomist.

Task If quicksort is so quick, why bother with anything else? If bubble sort is so bad, why even mention it? For that matter, why are there so many sorting algorithms? Your

What is Class invariants assertion A class invariant is an assertion which should be true of any class instance before and after calls of its exported operations. Generally

System defined data types:- These are data types that have been defined by the compiler of any program. The C language contains 4 basic data types:- Int, float,  char and doubl

infix to revrse polish

A depth-first traversal of a tree visits a nodefirst and then recursively visits the subtrees of that node. Similarly, depth-first traversal of a graph visits a vertex and then rec

one to many one to one many to many many to one