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. Data Structure

  • True, True
  • False, True
  • True, False
  • False, False
Answer: True, False
1028 students attemted this question.

Explanation

No Explanation Available.

Share this question with friends

Similar Questions

  1. Two lists, A and B are implemented as singly linked link-lists. The address of the first and last node are stored in variables firstA and lastA for list A and firstB and lastB for list B. Given the address of a node is given in the variable node, the element stored in the node can be accessed by the statement node->data and the address to the next node can be accessed by node->next. Pankaj wants to append list B at end of list A. Which of the following statements should he use?

  2. Statement 1: When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node.Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.

  3. A graph is a collection of nodes, called __________ And line segments called arcs or__________ that connect pair of nodes.

  4. Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?

  5. A complete binary tree with 5 levels has how many nodes? (Root is Level 1)

  6. _______________ is the data structure that has collection of nodes two fields named data and link.

  7. If node N is a terminal node in a binary tree then its ________

  8. ._____________ is a data structure in which every individual node consists of INFO to store data and LINK to store the address of the next node.

  9. A variant of linked list in which last node of the list points to the first node of the list is?

  10. It use pointer to link nodes.

  11. In a B+ tree, both the internal nodes and the leaves have keys.

  12. The maximum number of nodes on level I of a binary tree is which of the following? (Root is Level 1)

  13. Number of possible ordered trees with 3 nodes A, B, C is

  14. This structure uses a pointer to link nodes.

  15. Maximum degree of any vertex in a simple graph of vertices n is

  16. In linked list each node contain minimum of two fields. One field is data field to store the data second field is?

  17. Stack uses __________ data structure as the element that was inserted last is the first one to be taken out.

  18. A queue is a _________ data structure in which each element that was inserted first is the first one to be taken out.

  19. What does the following function do for a given Linked List with first node as head?

  20. In linked list each node is divided into ___________parts?

Comments

Add Your Review

Your email address will not be published.

Subscribe to Newsletter!

Subscribe to get latest updates and information.