0
we can find the balance factor of highty balance tree with height of left subtree- height of right sub tree
Wiki User
∙ 12y ago
Add your answer:
Earn +20 pts
What is spaning tree protocol?
STP stand for Spaning Tree Protocol. It's used to avoid the L2 loop in the network. many factor are belong to STP. such as Root Switch, BPDU, Root Port, Forward port, blocking port.
Prove that a graph G is connected if and only if it has a spanning tree?
Proving this is simple. First, you prove that G has a spanning tree, it is connected, which is pretty obvious - a spanning tree itself is already a connected graph on the vertex set V(G), thus G which contains it as a spanning sub graph is obviously also connected. Second, you prove that if G is connected, it has a spanning tree. If G is a tree itself, then it must "contain" a spanning tree. If G is connected and not a tree, then it must have at least one cycle. I don't know if you know this or not, but there is a theorem stating that an edge is a cut-edge if and only if it is on no cycle (a cut-edge is an edge such that if you take it out, the graph becomes disconnected). Thus, you can just keep taking out edges from cycles in G until all that is left are cut-gees. Since you did not take out any cut-edges, the graph is still connected; since all that is left are cut-edges, there are no cycles. A connected graph with no cycles is a tree. Thus, G contains a spanning tree. Therefore, a graph G is connected if and only if it has a spanning tree!
How much does a European beech tree grow in a year?
With the right conditions of a sunny location, well drained soil and a consistent moisture source, the American Beech tree can grow up to 24" per year with a maximum height of about 60' or 70' and a spread of about 40'. Though realistically, most of these trees do not have the perfect environment and would be fortunate to stay healthy and grow at about half that speed.
How many types of binary tree?
A binary tree is type of tree with finite number of elements and is divided into three main parts. the first part is called root of the tree and itself binary tree which exists towards left and right of the tree. There are a no. of binary trees and these are as follows : 1) rooted binary tree 2) full binary tree 3) perfect binary tree 4) complete binary tree 5) balanced binary tree 6) rooted complete binary tree
What tree does a conker come from?
a horsechestnut tree
What do you mean by re balancing of AVL tree?
AVL tree definition a binary tree in which the maximum difference in the height of any node's right and left sub-trees is 1 (called the balance factor) balance factor = height(right) - height(left) AVL trees are usually not perfectly balanced however, the biggest difference in any two branch lengths will be no more than one level
What is a factor tree and how do you know when a factor tree a completed?
21
How can the height of a tree be calculated?
It can easily be measured by using a protractor and measuring the angle between the ground and the top of the tree. You need to know exactly how far you are from the tree. Then you can use trigonometry to calculate the height of the tree. Tan (angle in degrees) = height of tree / distance from tree
What is purpose of AVL tree?
AVL TreesIn computer science, an AVL tree is the first-invented self-balancing binary search tree. In an AVL tree the heights of the two child subtrees of any node differ by at most one, therefore it is also known as height-balanced. Lookup, insertion, and deletion are all O(log n) in both the average and worst cases. Additions and deletions may require the tree to be rebalanced by one or more tree rotations. The AVL tree is named after its two inventors, G.M. Adelson-Velsky and E.M. Landis, who published it in their 1962 paper "An algorithm for the organization of information."The balance factor of a node is the height of its right subtree minus the height of its left subtree. A node with balance factor 1, 0, or -1 is considered balanced. A node with any other balance factor is considered unbalanced and requires rebalancing the tree. The balance factor is either stored directly at each node or computed from the heights of the subtrees.
What is a factor tree and how do youknow when a factor tree is complete?
When the bottom branch consists entirely of prime numbers.
Program for insertion and deletion operations in AVL tree?
Here is a high-level overview of insertion and deletion operations in an AVL tree: Insertion: Perform a standard BST insertion. Update the height of each node as the new node is inserted. Perform rotations if the balance factor of any node becomes greater than 1 or less than -1. Deletion: Perform a standard BST deletion. Update the height of each node as the node is deleted. Perform rotations if the balance factor of any node becomes greater than 1 or less than -1 to rebalance the tree.
How do you know whena factor tree is completed?
All the numbers are prime
What is the height of banyan tree?
it can grow upto 400ft in height
How can you find the height of tree?
Using trigonometery if you know the length of its shadow and angle of elevation
What is the factor tree for 5?
IT IS PRIME there is no factor tree
What is the 102 factor tree?
Factor tree of 204
What is a factor tree of 1500?
factor tree of 216
