algorithm - Reconstructing a tree using inorder and preorder traversals in Python -


I need to create a function that creates a tree from the preorder and the indoor traversel, but I'm not sure where Put the MacNode and recursive calls to make the panel properly.

There is a list of entrees considering the iners and the preederers, both of which are the following algorithms for rebuilding trees using trailers? 

  def build (preorder, inorder): root = preorder [0] subtree = inorder [: root-1] true subtree = inorder [root + 1:]   
 If so - how can he take it and use that algorithm in a recursive form to create arahep? I have a class designed to build nodes and then I can use just H.P.AD (node) to make a pile.  
 Ask me to create a node for the node, named "MacDoode" and its construction is as follows (for syntax purposes):  
  class makeonode (): def __init __ (self, character, left = none, right = none):   
 The root node I have to edit the function like this:  
  Def build (preorder, inorder, heap): root = preorder [0] node = mcod (root) # build root node here heap .add (node) #adding the heap subtree = inorder [: root-1] right subtree = inorder [root + 1:]   
 But how should I use recursion to build the rest of the tree? 
 I can include the left and right preorder to sort the objectives by doing this:  
  def build (preorder, inorder, heap): root = preorder [0] Node = MakeNode (root) heap.add (node) left subtree = inorder [: root-1] # left sequence # preorder [1: 1 + left subtree] right subtree = inorder [root + 1:] # command right Subtree = Preorder's [Route + 1:]   
 I do not know exactly how to include a recursive call to make a tree or what to fix for the left or right parameters, by doing this .  
 If someone has any suggestions, then I appreciate them, and I'm sorry, if I have been told to be ambiguous.   
 
 
 What do you need to do to add the root of the pre-ordered list to the tree, and remove it Divide the order from the preorder list to the order, as you are doing, then both the left and right branches are going through repetition. Keep adding the first element of the pre-order to the left of the previous node, unless the left_subtree is empty, you have to add it to the right  
 something like this (since asking for pseudo code The tree of the class (): def __init __ (self, inside, pre-order): self .root = preorder [0] lt = inorder [: Index (self.root) - 1] RT = Indoor [index (self.root) + 1:] self.build (self.root, lt, rt, preorder [1:] def (self, final_ode, byte_subtree, right_subtree, Pred Od): If lane (left_subtree)> gt: last_node.left = preorder [0] last_node = last_node.left lt = left_subtree [: index (pre-order [0]) 1] rt = left_subtree [index (pre-orders [0] ) + 1:] self.build (last_node, lt, rt, preorder1) alif lane (right_subtree)> gt: last_node.right = preorder [0] last_node = Last_node.right lt = right_subtree [: index (preorder [0] ) - 1] RT = Right_subtree [Index (Preder [0]) + 1:] Build (Last_Net, Lieutenant, RT, Preder 1:]

Comments

Post a Comment

Popular posts from this blog

Java - Error: no suitable method found for add(int, java.lang.String) -

I'm in the middle of homework work and I'm stuck. At this point in my code, I think that I should have a GUI window that opens and allows me to type "inserted text number". Notice is not going anywhere but at this point, If I pass through the problem then it will be in a linked list. I am getting two of the same error for the lines. Add (index, element); And I can not seem to get past it, there is no suitable method for the error "add (int, java. string string)". Code is below, please advise. To clarify - this will not be a method error because it is a linked list. There should not be any way involved. import java.awt. *; Import java.awt.event. *; Import javax.swing. *; Import java.util. *; Import java.util.Scanner; Import java.util.LinkedList; Public class TopTenList JFrame {Private TopTenList tt; See the Private JTextArea list; Private JTextField cmdTextField; Private JTextField resultsTestfield; // This GUI window is the code for the public toptist...
Read more

java - JPA TypedQuery: Parameter value element did not match expected type -

I am using JPA 2.0 and getting the following code in the DAO layer: Public Zero Test () {string key = "status"; String [] Conditions = {"A", "B"}; & Lt; TestTable & gt; Results = Search (Keys, Conditions); } Public listing & lt; TestTable & gt; Search (string key, object value error) {string sql = "test ndf to testlet and jade nand." + Key + "in:" + key; TypedQuery & LT; TestTable & gt; Query = entityManager.createQuery (SQL, TestTable.class); Query.setParameter (key, Arrays.asList (valueArr)) / *** Error Line *** Return query.getResultList (); } In the above error line, it throws the following exception: java.lang.IllegalArgumentException: parameter value element [[Ljava.lang.String; @ cbe5bc] did not match the expected type [java.lang.String] Why is this expected type string while actually this string []? Please help! Note: This is derived from the normal routine and is a simplified code. I can no...
Read more

c++ - static template member variable has internal linkage but is not defined -

Yes, I know, there is a question with almost the same title, but it refers to a different situation. Error message) In my case, I have a .cpp file with a big named designation name (implementation details). There is a property class template with a static data member in that name space, which I need to access from outside the unknown namespace. I give it a little bit of meat: file.hpp namespace Bar {template & lt; Typename A & gt; Struct foo {static_assert (is_same & lt; a, float & gt; :: value} is_same & lt; a, double>: value, ""); Fixed zero set_static_var (a const & x); // ...}; } and file.cpp namespace {template & lt; Typename A & gt; Struct foo_traits {// supports the implementation of several static code bars: foo & lt; & Gt; Fixed A data; }; The template's & lt; & Gt; Float foo_traits & lt; Float & gt; :: datum; // No change if this is in the global namespace template & lt; & Gt; Doub...
Read more