How many types of tree data structures are there?
The tree structure is useful because it easily accommodates the creation and deletion of folders and files.
plz tell me what is the advantages of tree in datastructure with database
A balanced tree is a tree which is balanced - it has roughly the same height on each of its sub-nodes. A balanced tree will have the lowest possible overall height. For e…xample, a balanced binary search tree will have equal heights (plus or minus one) on the left and right sub-trees of each node. This ensures that operations on the tree always are guaranteed to have O(lg n) time, rather than the O(n) time that they might have in an unbalanced tree. Certain tree algorithms are designed for ensuring that the tree stays balanced at all times, while maintaining the O(lg n) time for all operations. Such algorithms, such as red-black trees, AVL trees, and others, are generally used in standard library implementation of binary search trees.
There are many types of trees: - binary trees - binary search trees - B+ trees - red-black trees - AVL trees - suffix trees - and much more.... Each have dif…ferent rules for adding a new element, removing an element, and searching for an element in the tree. Consequently, they all have different advantages and disadvantages.
Using binary tree, one can create expression trees. The leaves of the expression tree are operands such as constants, variable names and the other node contains the operator (…binary operator). this particular tree seems to be binary because all the operators used are binary operators. it is also possible for a node to have one node also, in case when a unary minus operator is used. we can evaluate an expression tree by applying the operator at the root to the values obtained by recursively evaluating the left and right sub trees.
1. Binary Tree 2. Null Tree 3. High&Low Balance Tree . . .
For efficient storage of information the trees are used.
A rooted binary tree is a tree with a root node in which every node has at most two children. . A full binary tree (sometimes proper binary tree or 2-tree or strictl…y binary tree ) is a tree in which every node other than the leaves has two children. Sometimes a full tree is ambiguously defined as a perfect tree. . A perfect binary tree is a full binary tree in which all leaves are at the same depth or same level , and in which every parent has two children.  (This is ambiguously also called a 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.  . An infinite complete binary tree is a tree with a countably infinite number of levels, in which every node has two children, so that there are 2 d nodes at level d . The set of all nodes is countably infinite, but the set of all infinite paths from the root is uncountable: it has the cardinality of the continuum. These paths corresponding by an order preserving bijection to the points of the Cantor set, or (through the example of the Stern-Brocot tree) to the set of positive irrational numbers. . A balanced binary tree is commonly defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1,  although in general it is a binary tree where no leaf is much farther away from the root than any other leaf. (Different balancing schemes allow different definitions of "much farther"  ). Binary trees that are balanced according to this definition have a predictable depth (how many nodes are traversed from the root to a leaf, root counting as node 0 and subsequent as 1, 2, ..., depth). This depth is equal to the integer part of where is the number of nodes on the balanced tree. Example 1: balanced tree with 1 node, (depth = 0). Example 2: balanced tree with 3 nodes, (depth=1). Example 3: balanced tree with 5 nodes, (depth of tree is 2 nodes). . A rooted complete binary tree can be identified with a free magma. . A degenerate tree is a tree where for each parent node, there is only one associated child node. This means that in a performance measurement, the tree will behave like a linked list data structure. Note that this terminology often varies in the literature, especially with respect to the meaning of "complete" and "full".
Binary tree is a tree where each node has one or two children. . While in case of general tree , a node can have more than two children. . A binary tree can be empty, wh…ereas the general tree cannot be empty
find the minimum cost of the path to reach the desired node
Avl tree is self binary tree in which balancing factor lie between the -1 to 1.It is also known as self balancing tree. so BF=h(T(left sub tree))-h(T(right sub tree));
spanning tree is a tree which is used to find optimum path of a given graph
what is the addvantage and disaddvantage of tree
A balanced tree is a tree structure where all the nodes are evenly distributed, such that the tree is as close to symmetric as possible. In balanced binary trees, every leaf i…s at the same depth or is within one level of the majority of leafs, and the nodes are as evenly distributed on either side of the root as possible.
Tree is directed, cycle-less, connected graph.