Question

Number 1 to n are inserted in bst in some order in resulting tree right subtree rigt subtree contain p nodes

Answer 1

n– p

Binary Search Tree, is a node-based binary tree data structure which has the following properties:

The left subtree of a node contains only nodes with keys less than the node’s key.The right subtree of a node contains only nodes with keys greater than the node’s key.The left and right subtree each must also be a binary search tree.
There must be no duplicate nodes.