Which of the following need not be a binary tree?
@haralk10 see my answer, even A and B are correct.
D is the most appropriate answer.
A B-tree is a specialized M-way tree i.e. each node can have at most m childrens.
AVL tree and Heap are usually a complete binary tree.
Search Tree(assuming binary search tree). Therefore it is a binary tree.
64.3k questions
77.9k answers
244k comments
80.0k users