Describe the level term in a tree.
- 1 Answers
- 1010 Views
- I also Faced
- E-Mail Answers
Describe the level term in a tree...
Answer / Anand Kumar Singh
In a tree data structure, each node has a specific depth (level). The root node is at level 0, its children are at level 1, their children at level 2, and so on.
| Is This Answer Correct ? | 0 Yes | 0 No |
More Data Structures Interview Questions
What is the difference between arraylist and hashmap?
What is list and its types?
How many types of lists are there?
Can hashmap store null values?
Which sort is stable?
What is the slowest sorting algorithm?
what is atmost complete binary tree?
What is quick sort example?
How to sequentially represent max-heap?
What are the advantage of linked list over array?
How is a queue works?
Describe the merge sort principle and what will be its time complexity?
Windows 
