Proving certain binary tree property

Revision en1, by biximo, 2024-01-20 11:49:59

I recently came across a claim about binary trees that I was unable to prove. Given a binary tree, $$$\sum{|child_l|\times |child_r| } = O(N^2)$$$

Could someone provide proof and/or a way to intuitively explain this?

Tags tree

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English biximo 2024-01-20 11:49:59 252 Initial revision (published)