Data Structures

1: A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is called

A.	Full binary tree
B.	Binary Search Tree
C.	Threaded tree
D.	Complete binary tree
	Answer : D Explanation : Write your comments here: Updating your Comments.. Updating your Comments.. Report Error
	Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.

Sample Online Test

GK Test 4 Statement & Argument Numerical Reasoning Psychometric Online Test 1

UGC NET Paper 1 UGC NET Computer Science UGC NET Exam GATE Exam Aptitude Viva Questions General Knowledge Computer Questions Online Test

Data Structures

Sample Online Test

Suggest an improvement