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 the difference between array and stack in data structures?
Can we declare array size as a negative number?
How many sorting are there in data structure?
What do you mean by Logical Error
Why null is allowed in hashmap?
What are the 4 types of data?
Which of the collections allows null as the key?
What are the 3 types of measurement?
What is binary tree in discrete mathematics?
What do you mean by separate chaining?
State the advantages of using infix notations?
what is traversal in linked lists?
What is height balanced tree?
Explain what is a spanning tree?
Which sorting algorithm is considered the fastest?
