Search Tree¶
The Search tree data structure supports many dynamic-set operations, including $SEARCH,\ MINIMUM,\ MAXIMUM,\ PREDECESSOR,$
$ SUCCESSOR,\ INSERT,\ DELETE$
so we can use a search tree as a $dictionary$ and as a $priority\ queue$
DataStructure¶
We can represent it as linked objects
Each Node Containing¶
Each Node Contatining pointers : rightChild ,leftChild,parent