algorithm,binary-tree,binary-search-tree,inorder,preorder

If you have in-order traversal together with one of pre/post-order, that is enough to reconstruct a binary tree. Moreover, in case of BST (binary search tree), post-order or pre-order alone is sufficient. In your case, reconstructing a BST from pre-order 4, 1, 2, 3, 5, 6, 7, 8 gives the...

java,recursion,tree,huffman-coding,preorder

I believe this is the problem: makeTree(root.getLeftChild(), start++, treeString); I'm not sure what your approach is, but it looks like if you see an I, your plan is to go to the left node, and start examining the string starting at the next character. The reason for the infinite recursion...

java,search,binary-tree,tree-traversal,preorder

public Node search(int val) { Node target = this; if(target.getVal() == val) return this; else if(target.getRight() == null && target.getLeft() == null) return null; if(target.getRight() != null) { return target.getRight().search(id); //here lies the problem } if(target.getLeft() != null) { return target.getLeft().search(id); } return null; } The problem in your code...

algorithm,linked-list,binary-tree,binary-search-tree,preorder

Your convertLinkedListToBSThelper & getcount method work well.I have used your both method in my code. import java.util.*; class Solution{ static Node headNode; public static void main(String args[]){ Node node = new Node(1); headNode=node; Node node1 = new Node(2); Node node2 = new Node(3); Node node3 = new Node(4); Node node4...

algorithm,data-structures,binary-tree,inorder,preorder

Start with the preorder traversal. Either it is empty, in which case you are done, or it has a first element, r0, the root of the tree. Now search the inorder traversal for r0. The left subtree will all come before that point and the right subtree will all come...

php,data-structures,tree,preorder

data structure simple associative array will do the job array(2) { ["data"]=> int ["children"]=> array() } PHP <?php function makeTree($data, $children = array()) { $tree = array(); $tree['data'] = $data; $tree['children'] = $children; return $tree; } function traverse($tree) { echo $tree['data'] . "\n"; foreach($tree['children'] as $child) { traverse($child); } }...

So handling a pre-order tree traversal is the easier of the two, so we'll start there. The method will accept a sequence of items, and a function that accepts an item and translates it into a sequence of items, this lets us get all children for any given node. Then...