@Arjun Sir i mean here by definition no such rule for CBT.Because
A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.
But this property((i.e. every node the height of its left subtree and right subtree differ almost by 1) comes automatically in a complete binary tree.
Am i rt ?