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 breadth first tree?
How expression trees are gets represented in data structure?
how to insert a new node in linked list where free node will be available?
Explain the Array
What is the best time complexity of bubble sort?
Is array a data type?
How can you insert a node to the beginning of a singly linked list?
How many pointers are necessary to implement a simple linked list?
What is placement new in data structures?
Explain about the different lists available in the collection?
Which sorting algorithm is best for large data?
where do you use double linked list?
State the advantages of using postfix notations?
Tell me what is quick sort?
Can hashtable have duplicate values?
