| Share this post! | Vote this! |
|
A Binary Tree is a tree data structre in which each node has atmost two child nodes, usually called as 'left' and 'right' child respectively.
A binary tree which satisfies the 'binary-search-tree property' is a Binary Search Tree. Apart from having the child nodes ie 'left child' and 'right child' the binary search tree also has key (element stored inside the node).The Binary Search tree property is :
Let x be a node in
a binary tree. If y is a node in the left subtree of x, then y.key
<= x.key. If y is a node in the right of the subtree of x, then y.key
>= x.key. more...
0 comments:
Post a Comment