An algorithm that calls itself directly or indirectly is known as
Sub algorithm
Recursion
Polish notation
Traversal algorithm
In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called
Leaf
branch
path
thread
The in order traversal of tree will yield a sorted listing of elements of tree in
Binary trees
Binary search trees
Heaps
None of above
Which of the following data structure is non-linear type?
Strings
Lists
Stacks
Which of the following data structure is linear type?
Queues
All of above
The depth of a complete binary tree is given by
Dn = n log2n
Dn = n log2n+1
Dn = log2n
Dn = log2n+1
When representing any algebraic expression E which uses only binary operations in a 2-tree,
the variable in E will appear as external nodes and operations in internal nodes
the operations in E will appear as external nodes and variables in internal nodes
the variables and operations in E will appear only in internal nodes
the variables and operations in E will appear only in external nodes
A binary tree can easily be converted into q 2-tree
by replacing each empty sub tree by a new internal node
by inserting an internal nodes for non-empty node
by inserting an external nodes for non-empty node
by replacing each empty sub tree by a new external node
When converting binary tree into extended binary tree, all the original nodes in binary tree are
internal nodes on extended tree
external nodes on extended tree
vanished on extended tree
The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
ABFCDE
ADBFEC
ABDECF
ABDCEF