Q. In the deletion operation of max heap, the root is replaced by

View solution

Q. All possible spanning trees of graph G

View solution

Q. Binary search tree is an example of complete binary tree with special attributes.

View solution

Q. Maximum number of nodes in a binary tree with height k, where root is height 0, is

View solution

Q. In a min heap

View solution

Q. Re-balancing of AVL tree costs

View solution

Q. A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called ……

View solution

Q. Herder node is used as sentinel in …..

View solution

Q. In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.

View solution

Q. The property of binary tree is

View solution

Q. State true or false.

i) The degree of root node is always zero.

ii) Nodes that are not root and not leaf are called as internal nodes.

View solution

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