A binary Search Tree is a special type of binary tree data structure that has the following properties:
1 ) The left subtree of a node contains only nodes with keys lesser than the node’s key.
2 ) The right subtree of a node contains only nodes with keys greater than the node’s key.
3 ) The left and right subtree each must also be a binary search tree.
There must be no duplicate nodes.
Insert function is used to add a new element in a binary search tree at appropriate location. Insert function is to be designed in such a way that, it must node violate the property of binary search tree at each value. Allocate the memory for tree.
Please subscribe and support my youtube channel :-)
#meghuzlearning
#btech #ktu #malayalam #computer #s3
#computer #computerapplication #psc #computerscience
#diploma #polytechnic #insertion #binary #search #tree #bst #binarysearchtree
