![]() This rule will be recursively applied to all the left and right sub-trees of the root.Ī Binary search tree is shown in the above figure.Similarly, value of all the nodes in the right sub-tree is greater than or equal to the value of the root. ![]() ![]() In a binary search tree, the value of all the nodes in the left sub-tree is less than the value of the root.Binary Search tree can be defined as a class of binary trees, in which the nodes are arranged in a specific order.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |