Request New Subject
Home
Data Structures (DS)
Non Linear Data Structures - Trees
Q. In a full binary tree if number of internal nodes is I, then number of leaves L are? (Solved)
1. L = 2*I
2. L = I + 1
3. L = I – 1
4. L = 2*I – 1
b. L = I + 1
Related Topics
→ Linear Data Structures -Stacks and Queues
→ Non Linear Data Structures - Graphs
→ Searching, Sorting and Hashing Techniques
Subscribe Now
Get All Updates & News
Subscribe