A Kind of tree where every node in a tree can have at most two children. Data Structure

  • Binary Tree
  • Binary Expression Tree
  • Tree
  • Binary Search Tree
Answer: Binary Tree
857 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. 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.

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

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

  5. ._____________ 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.

  6. B-tree of order n is a order-n multiway tree in which each non-root node contains __________

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

  8. B-tree and AVL tree have the same worst case time complexity for insertion and deletion.

  9. A terminal node in a binary tree is called __________

  10. What is the value of the ROOT node in this Tree?

  11. The decision tree structure begins at a node called the _____.

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

  13. Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?

  14. Given a sequence of number below: 50,60,40,70,45,55,30,80,65,35,25,75,85When creating a binary search tree, what is the height of the tree?

  15. Given a binary search tree, insert 27, 15, 63, 99, 70 and 85 (in this order) into the binary search tree. What is the post-order traversal?

  16. Which of the following tree data structures is not a balanced binary tree?

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

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

  19. A B-tree of order 4 and of height 3 will have a maximum of _______ keys.

  20. What is the maximum number of keys that a B+ -tree of order 3 and of height 3 have?

Comments

Add Your Review

Your email address will not be published.

Subscribe to Newsletter!

Subscribe to get latest updates and information.