Define threaded binary tree. Explain its common uses
- 1 Answers
- 974 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Can you declare an array without assigning the size of an array?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
What sort of serious problems have you experienced, and how have you handled them?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
Write a program for Sorting an Array. Which sorting will you prefer?
