Answer by Shaull for Height of a full binary tree
Your claim is incorrect (which might make it really hard to prove...)Indeed, as you describe, you can have a full binary tree of height $O(n)$: Let every right child be a leaf, and every left child...
View ArticleHeight of a full binary tree
A full binary tree seems to be a binary tree in which every node is either a leaf or has 2 children.I have been trying to prove that its height is O(logn) unsuccessfully.Here is my work so far:I am...
View Article
More Pages to Explore .....
