If two trees have same structure and but different node content, then they are called ___

Related MCQs

• If two trees have same structure and node content, then they are called ____
• trees are B-trees of order 4. They are an isometric of trees.
• If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
• An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by
• Why to prefer red-black trees over AVL trees?
• If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?
• If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?
• Any node is the path from the root to the node is called
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
• In a directed tree any node which has out degree 0 is called a terminal node or__________.