I have a question concerning the relationship between vertices in a full binary tree and the internal vertices in a full binary tree. I'm assuming there is a formule for this problem, but I have been unable to locate it.
Thanks for the help, I really need to solve this question:
If a full binary tree has 231 vertices, then it has ____ internal vertices.
Thanks guys and gals!