Define depth and height of a tree?
- 1 Answers
- 1241 Views
- I also Faced
- E-Mail Answers
Answer / Shailza Singh
The depth of a node in a tree is the number of edges along the path from the root to that node. The height (or max depth) of a tree is the maximum depth among all its nodes. For an empty tree, both depth and height are 0.
| Is This Answer Correct ? | 0 Yes | 0 No |
What are the different binary tree traversal techniques?
Minimum number of queues needed to implement the priority queue?
Where is data structure used?
Discuss how to implement queue using stack.
What are the properties of binary heap?
Is arraylist a collection?
What is the difference between one and two dimensional?
What is the default size of arraylist?
What are different dynamic memory allocation technique in c.
Why do we use collections?
What is the difference between linked list and array?
What does list clear do?
Windows 
