3 votes 3 votes A binary search tree is a binary tree in which All items in the left subtree are less than root All items in the right subtree are greater than or equal to root Each subtree is itself a binary search tree All of the above DS ugcnetcse-june2012-paper2 data-structures binary-tree + – go_editor asked Jul 4, 2016 go_editor 1.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes clearly D all are true no explanation is needed i think Sanjay Sharma answered Jul 4, 2016 selected Jul 8, 2016 by Arjun Sanjay Sharma comment Share Follow See all 0 reply Please log in or register to add a comment.