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

  • Op 1: 2^l-1
  • Op 2: 3^l-1
  • Op 3: 2^l
  • Op 4: 2^l - 1
Answer: Op 1: 2^l-1
1996 students attemted this question.


No Explanation Available.

Share this question with friends

Similar Questions

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

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

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

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

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

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

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

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

  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. In a B+ tree, both the internal nodes and the leaves have keys.

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

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

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

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

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

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

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

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

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

  20. Binary TREE


Add Your Review

Your email address will not be published.

Subscribe to Newsletter!

Subscribe to get latest updates and information.