How to find external path length of a binary tree example?
Answers
Answered by
0
Explanation:
Steps:
Divide the decimal number by 16. Treat the division as an integer division.
Write down the remainder (in hexadecimal).
Divide the result again by 16. Treat the division as an integer division.
Repeat step 2 and 3 until result is 0.
The hex value is the digit sequence of the remainders from the last to first.
Answered by
0
Answer:
Answer ♡
- That is, the external path length of a full binary tree equals the internal path length plus twice the number of internal nodes. The proof will be by induction on I, the number of internal nodes.
Similar questions