0
Add your answer:
Earn +20 pts
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 largest possible number of internal nodes in a red-black tree with black height k?
largest possible number is (2^2k) - 1 nodes when every other node down to the path is red and it is complete binary tree with height 2k. smallest is (2^k) - 1 nodes
What is directed graph?
It's a set of nodes, together with edges that have directions associated with them.
What was the name of the band in chalmun's cantina in Star Wars-A New Hope?
Figrin D'an and the Modal Nodes.
Who was the first internet user?
Although I can't come up with a name, it was the US government, with the ARPA Net, mostly used for military communications. It was later expanded to become the internet. ~ ARPAnet was the first "user" of what's now the Internet. It connected 4 nodes: U of California @ LA, U of California @ Santa Barbara, Stanford Research Institute, and U of Utah.
What is the minimum no of nodes in a complete binary tree of height h?
h+1
What is the height of a complete binary tree of height h have?
Minimum is h nodes (Maximum is 2h+1 - 1 nodes, if tree consisting of only one node is considered to have height of 0. if you consider a tree with one node to be a height of one, then the minimum nodes is (2^(h-1)) 1 nodes. Minimum number of nodes in a binary tree of height is 2h+1. For example, if the height of the binary tree is 3, minimum number of nodes is 2*3+1=7.
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.
The height of Complete Binary tree is in terms of :option1. n2. logn3. n^2?
The height of a complete binary tree is in terms of log(n) where n is the number of nodes in the tree. The height of a complete binary tree is the maximum number of edges from the root to a leaf, and in a complete binary tree, the number of leaf nodes is equal to the number of internal nodes plus 1. Since the number of leaf nodes in a complete binary tree is equal to 2^h where h is the height of the tree, we can use log2 to find the height of a complete binary tree in terms of the number of nodes.
If a binary tree it have 18 nodes what is the minimum depth of the tree?
3
What is the height of a binary tree with n nodes in the worst case?
For the height `h' of a binary tree, for which no further attributes are given than the number `n' of nodes, holds:ceil( ld n)
How many leaf nodes does the full binary tree of height h 3 have?
For a full binary tree of height 3 there are 4 leaf nodes. E.g., 1 root, 2 children and 4 grandchildren.
Minimum number of nodes in a full binary tree with depth 3?
8
How many non leaf nodes are there in a complete binary tree of height h?
4
What is the minimum number of nodes in a full binary tree with depth 3?
A full binary tree of depth 3 has at least 4 nodes. That is; 1 root, 2 children and at least 1 grandchild. The maximum is 7 nodes (4 grandchildren).
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).
Count the number of nodes of a binary tree having depth n?
Use the following formula: (2^n)-1. E.g., if the depth is 3, the number of nodes is (2^3)-1 = 8-1 = 7. Note that 7 is the maximum number of nodes, not the actual number of nodes. To count the actual nodes you must traverse the tree, updating an accumulator as you go.
