Tree Definition and 290 Threads

Hi guys. Could you please give me more information regarding the necessary library and/or the code I should use to compute the Minimum Spanning Tree in R? Many thanks.

A tree seed takes water and minerals(?) from the ground, carbon and oxygen(?) from the air, and heat and light(?) from the sun. When a tree dies and dries up, it can be used as firewood, a source of energy. Is there a way to capture that energy without the seed-tree scenario? i.e., but can we...

Hi All, would someone (hopefully a professional), who has used Fault Tree Analysis read my essay and give me some pointers for improvement? I'd really appreciate if someone could help, especially since this is the only essay I've written in recent years.

I was looking for something else at Stack Exchange and found a how to draw a Christmas tree with Latex thread. I thought the one by Loop Space was the best! http://tex.stackexchange.com/questions/39149/how-can-we-draw-a-christmas-tree-with-decorations-using-tikz

My wife likes the old school bulb look so I picked up some C7 string lights for the tree. This year we got a real tree. I plugged the light string in and after a few minutes the bulbs got so hot I couldn't touch them. Are these things really that safe and ok to put around a tree? I must imagine...

Quite stuck on this how do i do this and how do i document each step?

What happens, if instead of having any pointer pointing to a node's parent, we had pointer pointing to the node's successor? We know, that Searching would remain the same. But in my opinion Insertion and Deletion would change. This would happen, because in insertion, we would be needed to find...

Consider the algorithms : TREE-SUCCESSOR(x) 1. if x.right_child !=NIL 2. return TREE-MINIMUM(x.right_child) 3. y=x.parent 4. while y != NIL and x == y.right_child 5. x = y 6. y = y.parent 7. return y TREE-MINIMUM(x) 1. while x.left_child != NIL 2. x = x.left_child...

My instructor asked us to create a binary search tree in python that supports variables. i.e. the tree will have variables inside, and the user can get the values for those variables by looking for the name of that variable. I don't really know how to implement this. What I have so far: class...

Does anyone know whether there exists a specialized Djikstra's algorithm for when every node has the same distance between it? Or to think of it another way, an algorithm for simply finding the minimum number of moves to get from 1 node to another? e.g. in the following A - B - C...

Dear friends, I'm unable to solve the following probability question. Please help me solve it. Thanks in advance. The answer given in the book is: 5/9 [for part (b)]. Don't know even if the answer is correct. Suzi has taken up golf, and she buys a golf bag containing five different clubs...

Homework Statement your car is stuck in the mud and you can’t pull hard enough to get it out. You do, however, have a long cable that you connect taut between your front bumper and the trunk of a stout tree. You now pull sideways on the cable at its midpoint, exerting a force f. Each half of...

Homework Statement (a) If e is part of some MST of G, then it must be a lightest edge in some cutset of G. Homework Equations Cut property The Attempt at a Solution When the cutset has just one edge then yes it's true obviously. I am think I can do this by contradiction. Assuming e_i is part...

Homework Statement In the book it gives following background for using threaded trees: "The concern is that some additional time has to be spent to maintain the stack & some more space has to be set aside for the stack itself." & then it says "It is more efficient to incorporate the stack as...

I need to generate a tree in a cubic lattice that, from any cell, visits every other cell in the lattice just once. This visit must be blind, that is, it is not allowed to mark the cell as visited. Thanks in advance for any solution or reference.

1. Homework Statement A tree is planted as a seedling of negligible height. The rate of increase of its height , in metres per year is given by ##0.2√(25-h)## a. explain why tree can't exceed 25 metres. answer⇒ ##dh/dt=0## when h=25 b. express t as a function of h answer⇒...

Hello all you folks! This question might not be the most advanced in universe yet I wonder. How does a tree for instance suck up water and nutricians from the ground? And why does it get rid of all the leaves in the winter (if it is not a pine tree that is)? Does it get rid of all the leaves...

Suppose I have a histogram : h(x) and I want to take the different values h(x_i) as weights which I can pass in a tree... The code I wrote so far, which (theoriticially) would do this job for me looks like this: TFile* fin = new TFile("file_contains_tree_and_histo.root"); TH1F* h_x = (TH1F*)...

Homework Statement We'll define a binary tree as a tree where the degree of every internal node is exactly 3. Show that the set of all binary trees is countable. Homework Equations A set is countable if it is finite or there is a one-to-one correspondence with the natural numbers. The Attempt...

Please delete this, I made a mistake with the problem and textbook.

domainwhale submitted a new PF Insights post High Temperature Low Temperature Duality for the Ising Model on an Infinite Regular Tree Continue reading the Original PF Insights Post.

Homework Statement Two trains of proper length L move toward each other in opposite directions on parallel tracks. They both move at speed v with respect to the ground. Both trains have clocks at the front and back, and these clocks are synchronized as usual in the frame of the train they are...

Homework Statement Explain and compare two efficient implementations of a priority queue using binary tree. Ilustrate this on an example of ascending priority queue that is created when elements 15, 38, 45, 21, 8, 55,20 are inserted and the two largest elements are deleted. Homework Equations...

The following algorithm describes a postorder tree traversal Postorder(tree) If left subtree exists then Postorder(left subtree) If right subtree exists then Postorder(right subtree) Print root end How can I apply that to the following tree...

Homework Statement Homework Equations Tree data structures. I think it might also have something to do with minimax algorithm, but it was only mentioned once and never discussed extensively in class so I doubt it is required. The Attempt at a Solution [/B] If both players play as well as...

Homework Statement I have the following algorithms: Prime MST with array, Prime MST with priorityq and Kruskal with priorityq. I have to choose the best algorithm to find the minimum spanning tree on a planar graph. A planar graph has the property in which the number of edges is in O(number of...

Got a question: I've got a Christmas tree that needs lights strung on it, but I want to know how to hang the lights so that the entire string is spaced evenly and it ends at the top with nothing left over. I figure there's a formula to derive this, but I don't know what it may be. Any...

Could someone please tell me the difference between tree diagrams and loop diagrams? If I'm thinking correctly tree diagrams are before contracting? Also how do vacuum diagrams fit into the picture? Thanks!

So I was done eating a banana while in the sidewalk, and had the peel on my hand. Instead of throwing it in the trash, I thought I would break it into pieces and throw the pieces into a small , planted area surrounding a tree, both contained within a metal encasing, so that the peel would...

Homework Statement A tree loses water to the air by the process of transpiration at the rate of 110 g/h. This water is replaced by the upward flow of sap through vessels in the trunk. If the trunk contains 1900 vessels, each 100 μm in diameter, what is the upward speed of the sap in each...

Homework Statement Hello! Typical binary search tree has a number of nodes equal to 2^(n+1) - 1. I don't understand why we add 1 to the n? For example: a tree has a height 4. # # # # # # # # # # # # # # # each level has 2^i nodes; i = 0, 2^0...

I am stuck on some non-coherent fault tree analysis. I have a non-coherent fault tree for which the TOP event breaks down to TOP = AD' + DA' + A'E. These are (I think) some of the prime implicants of the fault tree. There is also another prime implicant ED'. I've been trying to work through it...

When a tree grows even at an angle on a hill side it mostly remains vertical . What is at play here to cause the vertical direction of growth ? Thank you, Pat Hagar

Hi all, Im having trouble making a general algorithm for what at first glance appears to be a simple problem. If I have a volume (V) that can be made from two smaller, different volumes how can I decide which volumes to use to get the minimum wastage? So for example if V(required)=300 and my...

So I've been writing an algorithm to build a function tree and I believe I'm aaaaallllllmost there. The intent is to take a math function like x^2+x+1*5 and build it into / + \ / + \ / \ / ^ \ x 1 * 5 x 2...

Homework Statement The 180-lb tree surgeon lowers himself with the rope over a horizontal limb of the tree. If the coefficient of friction between the rope and the limb is 0.60, compute the force (P) which the man must exert on the rope to let himself down slowly. Homework Equations T1/T2...

Hi, Having a background of horticulture training (NZTCH) and tree specialisation (NSW Arbor Techniques & Tree Surgery), I'm very interested in biomechanics so enjoy books written by authors like Prof. Dr. Claus Mattheck http://www.mattheck.de/english/english2.htm My question is: Given a height...

Hi, Having a background of horticulture training (NZTCH) and tree specialisation (NSW Arbor Techniques & Tree Surgery), I'm very interested in biomechanics so enjoy books written by authors like Prof. Dr. Claus Mattheck http://www.mattheck.de/english/english2.htm No idea what forum area this is...

Homework Statement [/B] When Danny was 13, he went deer hunting with his grandfather. He decided that he didn't like the "kick" of the gun, so he pressed himself against a tree before firing a 12-gauge (3.5kg) loaded with a deer slug (0.22kg). Evaluate this idea. It was a big mistake. It...

While we were hiking in California, we came upon this dead tree. The tree was full of holes, presumably made by woodpeckers, and in most of the holes something had placed an acorn. Has anyone ever seen this? What places the acorns there? Woodpeckers? Squirrels? Something else?

Hello! (Wave) In my notes there is the following decision tree: Could you explain me how it is constructed? (Thinking)

Homework Statement A tree contains a known percentage p0 of a radioactive substance with half-life tau. When the tree dies the substance decays and isn't replaced. If the percentage of the substance in the fossilized remains of such a tree is found to be p1, how long has the tree been dead...

Homework Statement Does the following array represents the binary max heap 99,98,97,55,49,49,48,13,54 99,98,97,55,54,49,49,48,13 Homework EquationsThe Attempt at a Solution I've tried to construct the tree structure and all the above array representation satisfies the binary max heap property...

Hello! (Wave) We consider an $\text{ AVL }$ tree $T$. At each node $v$ of the tree the number of nodes of the left subtree of $v$ is stored. I want to write an algorithm that returns the $j^{th}$ smallest element of the tree in time $O(\log m)$ where $m$ is the number of nodes of the tree. How...

Hi! (Nerd) Given a tree, I want to write an algorithm, that deletes from each node, from the corresponding ordered binary tree, the rightmost child, that is a leaf. That's what I have tried: Algorithm(NODE *P){ if (P==NULL) return error; if (P->RC!=NULL) P=P->RC; if (P->LC!=NULL)...

Hi! (Wave) I want to write an algorithm, that counts the sum of the keys of the nodes of a binary tree, without the use of globals and statics. That's what I have tried: S(NODE *P){ if (P==NULL) return 0; int m=P->data+S(P->left); int n=m+S(P->right); return n; Could you tell me if it...

Hello! (Smile) I want to write an algorithm, that checks if a binary tree is full or not. Could you give me a hint how I could do this? (Thinking)

Hi! (Smile) I am looking at the following exercise: It is given a binary tree with 8 nodes and keys 2,4,6,8,10,12,14,16.The in-order tree traversal gives this order: 2,4,6,8,10,12,14,16. The pre-order traversal gives the order: 10,8,2,6,4,16,14,12. Draw the tree. Explain how you drawed it...

Hello! (Wave) Given a binary search tree $B$, I want to write an algorithm, that divides $B$ into two new trees $B_1, B_2$, so that the first one contains all the keys of $B$ that are smaller than $k$ and the second one contains all the keys of $B$ that are greater than $k$. Hint : Execute a...

Hello! (Wave) Suppose that we have a binary tree and a specific level $l$. I want to add in the tree, a node $e$, as a child of the leftmost node of the level $l$, if the latter hasn't two children. If the leftmost node of the level $l$ has two children, then we have to look for a leftmost...