The vertex of a binary tree is called an single child if it has a father's vertex but does not have a neighbor.
The root is not considered an single child.
let mark in numOnly a number of vertices in T that hold the attribute "single son ", and â€˜with n we mark the total number of vertices in the T tree.
Is it true that every binary tree called "T" if numOnly/n<=0.5
then the height of "T" maintains the condition: height(T)=O(logn)?
I think it's false, by the way, but possibly I don't understand how the big-O notation is used in this case when you don't have a function f(n) to work with.
30 seconds to difuse a loaf of bread ... here, use this tiny ad:
Building a Better World in your Backyard by Paul Wheaton and Shawn Klassen-Koop