Binary Trees

**1.**A binary tree whose every node has either zero or two children is called

**2.**The depth of a complete binary tree is given by

**3.**When representing any algebraic expression E which uses only binary operations in a 2-tree

**4.**A binary tree can easily be converted into q 2-tree

**5.**. When converting binary tree into extended binary tree, all the original nodes in binary tree are

**6.**The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal

**7.**An algorithm that calls itself directly or indirectly is known as

**8.**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

**9.**The in order traversal of tree will yield a sorted listing of elements of tree in

**10.**The complexity of Binary search algorithm is