In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.

Related Questions

• The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
• In a full binary tree if number of internal nodes is I, then number of nodes N are?
• When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
• Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
• The number of nodes in a complete binary tree of level 5 is__________.
• The maximum number of nodes on level i of a binary tree is ___________.
• In a full binary tree if number of internal nodes is I, then number of leaves L are?
• In a full binary tree if there are L leaves, then total number of nodes N are?
• Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?
• In a directed tree any node which has out degree 0 is called a terminal node or__________.