## Discussion Forum

Que. | 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. | AVL tree |

b. | Complete tree |

c. | Full binary tree |

d. | Binary search tree |

Answer:Binary search tree |