Time complexity of searching in B+ tree is O(log n).
Root node should contain atleast 2 children. Internal nodes has atleast $Ceil(\frac{n}{2})$.
And if parent node has (n-1) keys then it can have atmost n children.
All leaf node appear in the same level from left to right and each leaf node has a pointer to the next leaf.