Concept
Binary search tree (BST) is a binary tree in which
1.Left subtree of a node has all keys lesser than parent’s node key.
2.Right subtree of a node has all keys greater than parent’s node key.
Eg.
Leaf node : A node with no child nodes. (4,7,12)
Root node : Topmost node.(8)
Internal node : A node with child node/nodes.(8,5,11)
No comments:
Post a Comment