E N D
TOPICS > BINARY SEARCH TREE. > COMPLETE BINARY TREE. > TREE TRAVERSAL. PRESENTATION OF CSE- 201. BY AZHAR UDDIN ROLL : 09
BINARY SEARCH TREE Define of Binary tree: The Binary tree means that the node can have maximum two children. Here, binary name itself. And each node can have either 0, 1 or 2 children. A binary search tree follows some order to arrange the elements. In a Binary search tree ? THE VALUE OF LEFT NODE MUST BE SMALLER THAN THE PARENT NODE, AND THE VALUE OF RIGHT NODE MUST BE GREATER THAN THE PARENT NODE.
Click to Edit Title Click to Edit Sub Title