Is it possible to prove the following fact?

Any n-node binary tree T has a balanced edge: an edge whose removal will separate T into two binary trees, each having a most roundingUP[(2n-1)/3] nodes.?

and how does binary tree having a balanced edge look like??