How do you call a rooted tree if the number of branches per node is arbitrary (outdegree of n) but the indegree 1 for all nodes other than the root node?
That is none other than an rooted tree itself or, more accurately, an arborescence or branching tree or out-tree according to the following quote from Wikipedia entry on rooted tree.
A rooted tree is a tree in which one vertex has been designated the root. The edges of a rooted tree can be assigned a natural orientation, either away from or towards the root, in which case the structure becomes a directed rooted tree. When a directed rooted tree has an orientation away from the root, it is called an arborescence, branching, or out-tree; when it has an orientation towards the root, it is called an anti-arborescence or in-tree.
Your are also interested in what you might call "Poly-hierarchical rooted graph".
An arbitrary rooted tree could also be a poly-hierarchy as far as I understand, with some nodes having an indegree > 1 i.e. multiple parents.
However, since every vertex other than the root has a single parent in a rooted tree by definition, it is not a viable idea to call them "Poly-hierarchical rooted tree". The conventional name for them is multitree as illustrated below, thanks to Wikipedia.
A multitree may describe either of two equivalent structures: a directed acyclic graph in which the set of nodes reachable from any node form a tree, or a partially ordered set that does not have four items $a$, $b$, $c$, and $d$ forming a diamond suborder with $a\le b \le d$ and $a\le c \le d$ but with $b$ and $c$ incomparable to each other (also called a diamond-free poset).
You might be interested in polytree, as illustrated below, thanks to Wikipedia again. It is "also known as oriented tree or singly connected network". It is "a directed acyclic graph whose underlying undirected graph is a tree."
Another related concept is Hasse diagram, which is "used to represent a finite partially ordered set, in the form of a drawing of its transitive reduction", as illustrated below.
Exercise 1. Draw a polytree that is not a rooted tree. Draw a multitree that is not a polytree. Draw a Hasse diagram that is not a multitree.
Exercise 2. Every rooted tree is a polytree. Show that every polytree is a multitree. Show that every multitree is the Hasse diagram of some finite partially ordered set.