Binary Tree :-
1) Binary tree is a tree in which a node has only two children. Left child and right child.
2) Root is the top most element.
3) The sub trees are relatively smaller than the root tree.
Binary Search Tree:-
1) Binary search tree is an ordered binary tree only. There is one more additional rule -- subtrees on the left are smaller than the parent and subtrees on the right are greater than the parent.
1) Binary tree is a tree in which a node has only two children. Left child and right child.
2) Root is the top most element.
3) The sub trees are relatively smaller than the root tree.
Binary Search Tree:-
1) Binary search tree is an ordered binary tree only. There is one more additional rule -- subtrees on the left are smaller than the parent and subtrees on the right are greater than the parent.
No comments:
Post a Comment