What are skew trees? For a tree with 4 nodes draw all possible binary? Generalise for n nodes how many binary trees can be drawn?

Question

Accepted Answer

Skew trees are binary trees where each node has at most one child. For n nodes, there are n! possible binary trees.

Skew trees are binary trees where each node has at most one child.
For a tree with 4 nodes, all possible binary trees can be drawn by arranging the nodes in different orders.
Generalizing for n nodes, there are n! possible binary trees that can be drawn.