suppose a binary tree is constructed with n nodes, such that each node has exactly either zero or two children. the maximum height of the tree will be?
Welcome to the solution site, which is interested in answering educational questions, as it provides an answer to your questions in all areas
The solution site is concerned with questions, answers and solutions for all study materials for all levels
Through the word “Ask a Question” at the top of the site, you can ask any topic or any question or inquiry you want answered by users specialized
to solving questions and educational and academic activities that you ask
Now let’s answer your question
suppose a binary tree is constructed with n nodes, such that each node has exactly either zero or two children. the maximum height of the tree will be?
answer :
In a binary tree, a node can have maximum two children. If there are n nodes in binary tree, maximum height of the binary tree is n-1 and minimum height is floor(log2n)
