Data Structures

1: If each node in a tree has value greater the every value in its left subtree and has value less than every value in its right subtree, the tree is called

A.	Complete tree
B.	Full binary tree
C.	Binary search tree
D.	AVL tree
	Answer : C 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