0
- 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, whereas the general tree cannot be empty
Wiki User
∙ 11y ago
Wiki User
∙ 12y agoexplain explicitly with commends, the general tree implementation
Add your answer:
Earn +20 pts
What are the three general methods in implementing a programming language?
1- Compilation 2- Pure Interpretation 3- Hybrid Implementation System
What is the assembly language development phases?
Really no different than development in any other language: requirements definition, general design, detail design, coding, testing and implementation.
Is cursor implementation possible in queue or stack?
yes,cursor implementation possible in priority queue.
Difference between binary search tree and heap tree?
A binary search tree uses the definition: that for every node,the node to the left of it has a less value(key) and the node to the right of it has a greater value(key).Where as the heap,being an implementation of a binary tree uses the following definition:If A and B are nodes, where B is the child node of A,then the value(key) of A must be larger than or equal to the value(key) of B.That is,key(A) ≥ key(B).
What are the steps involved in SCM implementation?
The
Which directory implementation is mostly used in operating system?
Tree directory structure
How is hardware implementation of encryption algorithms superior to software implementation?
Hardware can be purpose-built for a single job, and can perform that job faster than any general-purpose hardware running a software implementation.
How does SQL allow implementation of the entity integrity and referencial integrity constraints what about general integrity constraints?
sql allow their implementation using various sql commands
What is a tree set?
A TreeSet is simply an implementation of the AbstractSet abstract class using a TreeMap to back the data. This is an ordered Set implementation with log(n) time cost to access or modify the data.
What is paging system implementation?
The question is not very clear - in general the implementation of paging is too complex to answer in a Wiki answer entry; I suggest you take a look at any Operating System theory book.
What is is the largest tree?
The largest tree in the world is a California Redwood tree named the General Sherman tree located in Sequoia National Park in California.
Is General Sherman a coniferous or deciduous tree?
The General Sherman is a conifer.
Tree that the highway goes through in Oakland California?
General Sherman Tree
Name of the largest living tree?
The General Sherman is the largest tree in the world.
Why you represent the general trees as binary trees?
General trees are not binary trees. It is the other way around, however, see the last paragraph for a different answer - explanation first... A binary tree is one with two possible child nodes, a left node and a right node, either of which might be not present. This particular representation implies a certain order between the node and its children, and if you walk the tree from bottom left to bottom right, you will traverse the nodes in order. A general tree is one with any number of possible child nodes, including no child nodes, so a binary tree is an example of a general tree, while a general tree is a generalization of a binary tree. However, in the general tree, the meaning of the child nodes might not have any specific ordering, like those in a binary tree, unless the general tree has other information contained in the node about order, because the concept of left and right has no implied meaning when there are more than two children. But, as promised, if the general tree has order, it is always possible to represent the general tree as a binary tree - there will just be more nodes, but they will only contain zero, one, or two children, and they will have an implied order.
General sherman is the name of the largest what?
tree
Which tree contains more wood than any tree in the world?
General Sherman
