If node N is a terminal node in a binary tree then its ________ Data Structure

  • Right tree is empty
  • Left tree is empty
  • Both left & right sub trees are empty
  • Root node is empty
Answer: Both left & right sub trees are empty
1338 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. A terminal node in a binary tree is called __________

  3. 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?

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

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

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

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

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

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

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

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

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

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

  14. Binary TREE

  15. In preorder traversal of a binary tree the second step is ____________

  16. When traversing a binary tree, which diagram is post-order?

  17. When traversing a binary tree, which diagram is pre-order?

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

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

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

Comments

Add Your Review

Your email address will not be published.

Subscribe to Newsletter!

Subscribe to get latest updates and information.