Answer Posted / ashutosh
a binary tree is a tree in which each naode have 2 child
except leaf naode.
| Is This Answer Correct ? | 5 Yes | 2 No |
Post New Answer View All Answers
Is quicksort greedy algorithm?
How would you implement two stacks using a single array?
Which sort algorithm is best?
In depth questions regarding the data structures and the Databases used in the Projects developed.
Differentiate between push and pop?
What are the best data structure courses for gate preparation?
What are the applications of linked list?
How do you balance a tree?
Which is the slowest sorting algorithm?
What is a multidimensional array?
Explain what are the notations used in evaluation of arithmetic expressions using prefix and postfix forms?
Is list an array?
What is pivot in quicksort?
What is time and space complexity of bubble sort?
Describe the degree term in a tree.