What is a BST? Write a function to implement insertion operation in a BST and explain searching in the same.
Anonymous
A BST is a tree data structure in which the values in the left subtree are smaller than the node and values on the right subtree are larger than or equal to the node in observation. Then I wrote the insertion function and explained to him the searching method. He was satisfied.
Check out your Company Bowl for anonymous work chats.