The maximum number of nodes on level I of a binary tree is which of the following? (Root is Level 1) Data Structure
Answer: Op 1: 2^l-1
No Explanation Available.
Share this question with friends
A complete binary tree with 5 levels has how many nodes? (Root is Level 1)
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?
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?
Which of the following tree data structures is not a balanced binary tree?
B-tree of order n is a order-n multiway tree in which each non-root node contains __________
Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?
A graph is a collection of nodes, called __________ And line segments called arcs or__________ that connect pair of nodes.
Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?
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.
In a B+ tree, both the internal nodes and the leaves have keys.
When traversing a binary tree, which diagram is post-order?
When traversing a binary tree, which diagram is pre-order?
What is the maximum number of keys that a B+ -tree of order 3 and of height 3 have?
What is the value of the ROOT node in this Tree?
A Kind of tree where every node in a tree can have at most two children.
B-tree and AVL tree have the same worst case time complexity for insertion and deletion.
A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called
A terminal node in a binary tree is called __________
If node N is a terminal node in a binary tree then its ________