Answer Posted / arnoldindia
A binary tree is a tree in which each node can have at most
two children. (i.e., left child and/or right child)
| Is This Answer Correct ? | 39 Yes | 5 No |
Post New Answer View All Answers
What is the use of tree data structure?
What is time and space complexity of bubble sort?
What is complexity of quicksort?
How does selection sort work?
What is the slowest sorting algorithm?
What is vector and types of vector?
What is a queue in data structure?
What is a stable sorting algorithm?
How will you check the validity of an expression containing nested parentheses?
Is hashset a collection?
Differentiate between compilers and interpreters.
What are the topics in data structures?
What is the prerequisite for binary searching?
What is data type and its types?
In Data Structure, write output of given program.
