Request New Subject
Home
Computer Science Engineering (CSE)
Data Structures (DS)
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
→ Computer Architecture and Organization
→ Microprocessor and Interfacing Technique
→ Computer Networks
→ Data Structure and Algorithms (DSA)
→ Operating System (OS)
→ Artificial Intelligence and Robotics (AIR)
→ Software Project Management (SPM)
→ Computer Fundamentals
→ High Performance Computing (HPC)
→ Data Communication and Computer Network
Subscribe Now
Get All Updates & News
Subscribe