Q. Any node is the path from the root to the node is called

View solution

Q. State true of false.

i) A node is a parent if it has successor nodes.

ii) A node is child node if out degree is one.

View solution

Q. …………………. Is a directed tree in which out degree of each node is less than or equal to two.

View solution

Q. State true or false.

i) An empty tree is also a binary tree.

ii) In strictly binary tree, the out-degree of every node is either o or 2.

View solution

Q. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return

View solution

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

View solution

Q. The depth of a complete binary tree is given by

View solution

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

View solution

Q. A binary tree can easily be converted into a 2-tree

View solution

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

View solution

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

View solution

Q. 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

View solution

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

View solution

Q. In a Heap tree

View solution

Q. Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are:

Note: The height of a tree with a single node is 0.

View solution

Q. Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is _____.

View solution

Q. B Trees are generally

View solution

Q. If a node having two children is deleted from a binary tree, it is replaced by its

View solution

Q. A full binary tree with 2n+1 nodes contain

View solution

Q. If a node in a BST has two children, then its inorder predecessor has

View solution