Answer Posted / sri
A binary tree is a tree which is either empty or each node
has at-most two children
The root node is the parent of all the nodes
its height is given by log n base 2 where n is the no of
elements
| Is This Answer Correct ? | 3 Yes | 0 No |
Post New Answer View All Answers
What is an example of an algorithm?
How do I remove a value from a list?
Tell me the difference between structure and array?
Define splay tree?
How do you do a selection sort?
What is storage structure in data structure?
How do you find a string is anagram or not?
Does hashmap allow null keys?
Describe the height term in a tree.
Differentiate null and void?
Explain pre-order and in-order tree traversal.
Define right-in threaded tree?
What is meant by heap sort?
What is a 2 dimensional array?
Explain the term base case?
