Define threaded binary tree. Explain its common uses
- 1 Answers
- 973 Views
- I also Faced
- E-Mail Answers
Answer / Chetan Pd Singh
A threaded binary tree is a modification of a binary tree where each node has additional links (threads) to other nodes that would be reached by a left or right inorder traversal from that node's successor or predecessor, respectively. These threads allow for more efficient inorder traversals without needing to store explicit pointers to parent nodes. Common uses include:
1. Implementing data structures like stacks and queues using the threaded binary tree structure.
2. Improving the efficiency of certain algorithms that require multiple passes over the same data, such as depth-first search (DFS) or breadth-first search (BFS).
| Is This Answer Correct ? | 0 Yes | 0 No |
What are the objectives of studying data structures?
How do you find the height of a binary tree?
Name the areas in which you can apply data structures extensively?
Are dictionaries mutable?
What is adt in data structure with example?
Provide an algorithm to reverse a linked list without using recursion.
What do you mean by general trees?
What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero)
18 Answers CSC, National Instruments, Sasken, Sybrant Technologies,
What is difference between array and arraylist?
Is pointer a variable in data structure?
Describe stack operation.
Tell me do array subscripts always start with zero?
Windows 
