Answer Posted / r. khan
A tree with root[T]has the following properties
if roo[T] is NULL, then there is no node,
otherwise,every node in the tree has at most two child
nodes.
| Is This Answer Correct ? | 9 Yes | 7 No |
Post New Answer View All Answers
What are the standard ways in which a graph can be traversed?
Is learning data structures necessary?
What are three common types of traversals?
What are the goals of data structure?
Describe tree rotation in avl tree.
List the area of applications where stack data structure can be used?
Which language is best for data structures?
What is non linear structure?
What is the best case for bubble sort?
How do you represent a linked list?
What is arraylist load factor?
How does a hashmap work?
How do you define a set?
Why do we need algorithm?
What is b tree in data structure?