0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What is the number of nodes in a strictly binary tree which has n leaves?
IF EVERY NON-LEAF NODE IN A BINARY TREE HAS HAS NONEMPTY LEFT AND RIGHT SUBTREES, THE TREE IS TERMED AS A STRICTLY BINARY TREE. SUCH A TREE WITH n LEAVES ALWAYS CONTAINS 2n-1 NODES.
Number of possible binary tree with 3 nodes is?
12
General tree to binary tree conversion?
The process of converting the general tree to a binary tree is as follows: * use the root of the general tree as the root of the binary tree * determine the first child of the root. This is the leftmost node in the general tree at the next level * insert this node. The child reference of the parent node refers to this node * continue finding the first child of each parent node and insert it below the parent node with the child reference of the parent to this node. * when no more first children exist in the path just used, move back to the parent of the last node entered and repeat the above process. In other words, determine the first sibling of the last node entered. * complete the tree for all nodes. In order to locate where the node fits you must search for the first child at that level and then follow the sibling references to a nil where the next sibling can be inserted. The children of any sibling node can be inserted by locating the parent and then inserting the first child. Then the above process is repeated.
What is the difference between primitive and non primitive data structure?
A primitive data structure is generally a basic structure that is usually built into the language, such as an integer, an array or a linked-list.A non-primitive data structure is built out of primitive data structures linked together in meaningful ways, such as a binary search tree, AVL Tree, Hashtable, etc.
How do you defeat the 5th level of full moon on cool math?
I'm going to tell you how do to up to level 11 on full moon, cool maths games. I can only tell you the answers up to level 7. Level 1. You click the owl 4 times and then wait for it to go to sleep then click what you need. level 2. Just tap the first 3 not the 4th one and then the next 3. level 3. Click the tree 3 times for a leaf to come down, so that an acorn can sit on the leaf and once that has done, you then move the rock out the way of the leaf carrying the acorn level 4. Move your mouse to the balloon, and keep it on there and don't take your mouse off the balloon, don't go off the page or in the tree, just always keep you mouse in the balloon. level 5. Move the big rock on the big hill then move the small rock on the small hill. level 6. Click 7 lights on the semicircular thing, and then leave the next one out, then click again, then click two again. level 7. Move your mouse into the tree in a space where all 4 owls are in (and hidden).
What is the difference between strictly binary tree and complete binary tree?
Complete Binary tree: -All leaf nodes are found at the tree depth level -All nodes(non-leaf) have two children Strictly Binary tree: -Nodes can have 0 or 2 children
What is the difference between extended binary tree and complete binary tree?
Complete Binary tree: All leaf nodes are found at the tree depth level and All non-leaf nodes have two children. Extended Binary tree: Nodes can have either 0 or 2 children.
Is sorting a binary search tree simple?
A binary search tree is already ordered. An in order traversal will give you a sorted list of nodes.
What is incomplete binary tree?
Incomplete Binary Tree is a type of binary tree where we do not apply the following formula: 1. The Maximum number of nodes in a level is 2
How many nodes are there in the nth of a binary tree?
If N>1, there are (2N-1) - (2N-1-1), otherwise, 1 nodes in the Nth level of a balanced binary tree.
What is the minimum number of nodes in a binary tree of depth k?
if u assign a 0th level to root of binary tree then,the minimum no. of nodes for depth K is k+1.
What is the height of binary search tree in worst case?
In the worst case a binary search tree is linear and has a height equal to the number of nodes. so h=O(h).
What is the maximum number of nodes on a given level of a binary tree?
Level N of a binary tree has, at most, 2^N nodes. Note that the root node is regarded as being level 0. If we regard it as being level 1, then level N would have 2^(N-1) nodes at most.
Definition of almost complete binary tree?
A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.
In binary search tree n equals nodes h equals height of tree what is time complexity?
O(h)
What is the number of nodes in a complete binary tree of level 5?
If the number of levels is L, the maximum number of nodes N in a binary tree is N = 2L-1. For L = 5, N equates to 31 thus.
What is the difference between extended binary tree and a binary search tree?
A strictly binary tree is one where every node other than the leaves has exactly 2 child nodes. Such trees are also known as 2-trees or full binary trees. An extended binary tree is a tree that has been transformed into a full binary tree. This transformation is achieved by inserting special "external" nodes such that every "internal" node has exactly two children.
