Register to reply

Question on Binary tree

by algonewbee
Tags: binary, tree
Share this thread:
algonewbee
#1
Sep17-08, 07:24 PM
P: n/a
The internal path length of a full binary tree is the sum, taken over all internal nodes of the tree, of the depth of each node. Likewise, the external path length is the sum, taken over all leaves of the tree, of the depth of each leaf. Consider a full binary tree with n internal nodes, internal path length i, and external path length e. Prove that e=i+2n
Phys.Org News Partner Science news on Phys.org
Security CTO to detail Android Fake ID flaw at Black Hat
Huge waves measured for first time in Arctic Ocean
Mysterious molecules in space
dodo
#2
Sep18-08, 02:01 AM
P: 688
Ask yourself what does it mean for the tree to be "full". How many leaves does it have?

Probably this should not be in the number theory forum.


Register to reply

Related Discussions
A question about binary tree(java) Programming & Computer Science 2
A binary tree question(java) Programming & Computer Science 6
Need help with binary tree code Engineering, Comp Sci, & Technology Homework 2
Full Binary Tree question Introductory Physics Homework 2
Binary/AVL tree animation Computing & Technology 3