notes self assessment state whether the following statements are true or false binary search tree is not binary tree which may be fulland every node contains an identifier dictionary is an ordered list which is required to be searched frequentlyand is also required to be updated frequently avl tree invented by adelsonvelskii and landis implementations of avl tree insertion rely on deleting an extra attribute the balance factor to each node identifier of any node in the right sub-tree is greater than the identifier of the root and the left sub-tree as well as right sub-tree both are binary search trees fill in the blanks binary search tree is basically binary treeand therefore it can be traversed is inorderpreorderand to create we use procedure named insert which creates new node with the data value supplied as parameter to itand inserts into an already existing tree whose root pointer is also passed as parameter to from binary search tree the method to be used depends on whether node to be deleted has one childtwo childrenor has no child to search the binary tree for particular nodewe use procedures similar to those we used when to it more efficient implementation of dynamic dictionary involves considering key to be sequence of review questions describe binary search tree also explain how will you create binary search tree how will counting the number of nodes in binary search treeexplain describe deletion of node with one child question - are based on the following binary search tree answer each question independentlyusing the original tree as the basis for each part lovely professional university