Hi everyone,
while studying binary trees, I came across this thing that a complete binary tree
has ceiling (n/2) leaves. Why is that ? and if I am to prove this through induction, what would be my base case?
acidburns
0
Newbie Poster
Narue
5,707
Bad Cop
Team Colleague
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.