Answer Posted / glibwaresoftsolutions
An extension of the linked list structure, a binary tree contains no more than two children per node.
There are always two nodes in a binary tree: a left node and a right node.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is a queue in data structure?
How do you find the depth of a binary tree?
Does hashset allow duplicates?
In tree construction which is the suitable efficient data structure?
What do you mean by breadth first search (bfs)?
How do you rotate an AVL tree?
What's the difference between an array and vector?
What is the heap in data structures?
What is meant by strongly connected in a graph?
How to do the intersection of two sorted arrays?
What is a graph?
Which sorting algorithm is used in arrays sort?
Explain binary searching, Fibonacci search.
Is hashmap fail safe?
Which language is best for data structures?