Interested to Buy Any Domain ? << Click Here >> for more details...
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
What is the difference between b tree and binary search tree?
Is linked list faster than array?
What is 1d array?
Which collection is fail safe?
Is arraylist faster than array?
Write an algorithm to find middle element in the linked list.
How would you sort words in a large file?
What is scalar example?
What is difference between concurrenthashmap and hashtable?
How to initialize Dictionary using collection initialize?
What is a tech stack?
Mention for which header list, you will found the last node contains the null pointer?
What is the default size of an arraylist?
What is variable size arrays?and why we use it?
Define balancing condition for AVL Tree.
