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

Ask an Expert

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

Write your message here..

Related Questions

Primitive data structure, Primitive Data Structure These are the basic ... Primitive Data Structure These are the basic structure and are directly operated upon by the machine instructions. These in general have dissimilar representations on different

Total impedent of the circuit, an electrical student designed a circuit in... an electrical student designed a circuit in which the impedence in one part of a series circuit is 2+j8 ohms and the impedent is another part of the circuit is 4-j60 ohm mm program

B-TREE and AVL tree diffrance, Explain process of B-TREE and what differen... Explain process of B-TREE and what difference between AVL Tree Using Algorithms

Hasing and indexing, differentiate between indexing and hashing in file org... differentiate between indexing and hashing in file organization

Procedure of analysis of algorithm, Example 1:  Following are Simple sequen... Example 1:  Following are Simple sequence of statements Statement 1;  Statement 2; ... ... Statement k; The entire time can be found out through adding the times for

Omega notation, The ?-Notation (Lower Bound) This notation provides a l... The ?-Notation (Lower Bound) This notation provides a lower bound for a function to within a constant factor. We write f(n) = ?(g(n)), if there are positive constants n 0 and

Preorder - postorder and inorder, 1) preorder, postorder and inorder 2) ... 1) preorder, postorder and inorder 2) The main feature of a Binary Search Tree is that all of the elements whose values is less than the root reside into the nodes of left subtr

Process of analysis, The objective analysis of an algorithm is to determine... The objective analysis of an algorithm is to determine its efficiency. Efficiency is based on the resources which are used by the algorithm. For instance, CPU utilization (Ti

Adjacency matrix of an undirected graph, 1) What will call a graph that hav... 1) What will call a graph that have no cycle? 2) Adjacency matrix of an undirected graph is------------- on main diagonal. 3) Represent the following graphs by adjacency matr

Red-black tree after insertion, The above 3 cases are also considered conve... The above 3 cases are also considered conversely while the parent of Z is to the right of its own parent. All the different kind of cases can be illustrated through an instance. Le