What you are doing is essentially a DFS of the tree. You can eliminate recursion by using a stack: traverse(Node node) { if (node==NULL) return; stack<Node> stk; stk.push(node); while (!stk.empty()) { Node top = stk.pop(); for (Node child in top.getChildren()) { stk.push(child); } process(top); } } If you want a BFS use a queue: traverse(Node … Read more
Start with the recursive algorithm (pseudocode) : traverse(node): if node != None do: traverse(node.left) print node.value traverse(node.right) endif This is a clear case of tail recursion, so you can easily turn it into a while-loop. traverse(node): while node != None do: traverse(node.left) print node.value node = node.right endwhile You’re left with a recursive call. What … Read more
Just build one level at a time, e.g.: class Node(object): def __init__(self, value, left=None, right=None): self.value = value self.left = left self.right = right def traverse(rootnode): thislevel = [rootnode] while thislevel: nextlevel = list() for n in thislevel: print n.value, if n.left: nextlevel.append(n.left) if n.right: nextlevel.append(n.right) print thislevel = nextlevel t = Node(1, Node(2, Node(4, … Read more
How about Morris Inorder tree traversal? Its based on the notion of threaded trees and it modifies the tree, but reverts it back when its done. Linkie: http://geeksforgeeks.org/?p=6358 Doesn’t use any extra space.
You can increment the stack depth allowed – with this, deeper recursive calls will be possible, like this: import sys sys.setrecursionlimit(10000) # 10000 is an example, try with different values … But I’d advise you to first try to optimize your code, for instance, using iteration instead of recursion.
Ok, so in a comment above the question asker Fidilip said that what he/she’s really after is to get the path to the current element. Here’s a script that will “climb” the DOM ancestor tree and then build fairly specific selector including any id or class attributes on the item clicked. See it working on … Read more
Try: $(‘li.current_sub’).prevAll(“li.par_cat:first”); Tested it with your markup: $(‘li.current_sub’).prevAll(“li.par_cat:first”).text(“woohoo”); <script src=”https://cdnjs.cloudflare.com/ajax/libs/jquery/3.3.1/jquery.min.js”></script> <ul> <li class=”par_cat”></li> <li class=”sub_cat”></li> <li class=”sub_cat”></li> <li class=”par_cat”>// this is the single element I need to select</li> <li class=”sub_cat”></li> <li class=”sub_cat”></li> <li class=”sub_cat current_sub”>// this is where I need to start searching</li> <li class=”par_cat”></li> <li class=”sub_cat”></li> <li class=”par_cat”></li> </ul> will fill up the closest … Read more
If I am reading the algorithm right, this should be an example of how it works: X / \ Y Z / \ / \ A B C D First, X is the root, so it is initialized as current. X has a left child, so X is made the rightmost right child of X‘s … Read more
These two terms differentiate between two different ways of walking a tree. It is probably easiest just to exhibit the difference. Consider the tree: A / \ B C / / \ D E F A depth first traversal would visit the nodes in this order A, B, D, C, E, F Notice that you … Read more