Home /
Expert Answers /
Computer Science /
nbsp-answer-the-following-questin-subject-data-structure-6-represent-binary-search-tree-using-pa133
Expert Answer
In binary search tree when we insert a number then we check if the number is bigger or smaller than the value of the current node. If bigger then do t