How will you calculate the depth of a binary tree if the tree contains 15 nodes?
- 1 Answers
- 1171 Views
- Aricent, I also Faced
- E-Mail Answers
Answer / Dinesh Kumar Meena
The depth of a binary tree is defined as the maximum number of edges from the root node to any leaf node. To find the depth of a binary tree with 15 nodes, we can use a recursive approach starting at the root node and counting the levels or branches until we reach the last level where all nodes are leaves. Since there are 2^n - 1 nodes in the nth level of a full binary tree, and the total number of nodes is 15 (which is greater than or equal to 2^4), we can deduce that the depth of this binary tree is at least 4.
| Is This Answer Correct ? | 0 Yes | 0 No |
Is map ordered in java?
What is the life cycle of an Applet ?
How to display arraylist values in java?
Is space a character in java?
Is 0 an even number?
If system.exit (0); is written at the end of the try block, will the finally block still execute?
What is a functional interface?
What is arrays aslist in java?
What does indexof mean?
what is the volatile modifier for? : Java thread
Explain restrictions on using enum?
WHAT IS THE MEANING OF ALL TYPE OF BUZZWORDS?
Core Java 
