In a binary tree, certain null entries are replaced by special pointers which po

Question

In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in tree for efficiency. These special pointers are called

Options:

A . Leaf

B . Branch

C . Path

D . Thread

Answer: Option D

Submit Your Solution Below and Earn Points !

Next Question

Submit Solution

More Questions on This Topic :

Question 1. Which of the following statement is false ?....

Question 2. The following data structure is non-linear type....

Question 3. The elements of an array are stored successively in memory cells because....

Question 4. The time factor when determining the efficiency of algorithm is measured by....

Question 5. The memory address of the first element of an array is called....

Question 6. In a graph if e=[u, v], Then u and v are called....

Question 7. The Average case occur in linear search algorithm....

Question 8. Which of the following data structures are indexed structures....

Question 9. The difference between linear array and a record is....

Question 10. Arrays are best data structures for....

Chapter 1 - GLOBAL STEEL SCENARIO & INDIAN STEEL INDUSTRY Part 1 : (13-04-2024) INDUSTRY AND COMPANY AWARENESS (ICA)

Direction Sense Test Part 1 Reasoning (Hindi)

Chapter 1 - RMHP / OHP / OB & BP Part 1 : (14-02-2024) GPOE

Cube & Cuboid Part 1 Reasoning (Hindi)

Data Interpretation (DI) Basic Concept Reasoning (Hindi)

Counting Figures Part 1 Counting Of Straight Lines Reasoning (Hindi)

Sail E0 free webinar Webinars

Real Numbers Part 7 Class 10 Maths

Real Numbers Part 1 Class 10 Maths

Polynomials Part 1 Class 10 Maths

DSP Combined 1 Free Revision Test SAIL JO E-0

GPOE / GPA Combined 1 Free Revision Test SAIL JO E-0

BSP Plant Specific Review Test SAIL JO E-0

BSL Combined 1 Free Revision Test SAIL JO E-0

GFM Combined 1 Free Revision Test SAIL JO E-0

Submit Solution

More Questions on This Topic :

Latest Videos

Latest Test Papers