1
Question
If each node in a tree has value greater then every value in its left subtree and has value less than every value in its right subtree, the tree is know as
If each node in a tree has value greater then every value in its left subtree and has value less than every value in its right subtree, the tree is know as
Open in App
Solution
The correct option is B Binary search tree
If each node in a tree has value greater then every value in its left
subtree and has value less than every value in its right subtree, the tree is
known as binary search tree.
A binary search tree is a binary tree in a symmetric order, where
each node has a key (and an associated value).
A binary tree means it consists of nodes, and each node has at most two
children (left and right child).
The left sub-tree of a node has a key less than or equal
to its parent node's key.
The
right sub-tree of a node has a key greater than to its parent node's key.
If each node in a tree has value greater then every value in its left subtree and has value less than every value in its right subtree, the tree is known as binary search tree.
A binary search tree is a binary tree in a symmetric order, where each node has a key (and an associated value).
A binary tree means it consists of nodes, and each node has at most two children (left and right child).
The left sub-tree of a node has a key less than or equal to its parent node's key.
The right sub-tree of a node has a key greater than to its parent node's key.
Suggest Corrections
0
Join BYJU'S Learning Program
Explore more
Join BYJU'S Learning Program
