You want a algorithm to convert tree to binary tree?

Answer 1

The simplest way to do this is to iterate over your general tree and add each value you find to a new binary tree. The logic of the binary tree will take care of the "conversion" for you.

Note: The problem with this is that your "general" tree might already contain data in sorted order. If this is the case and you're doing an in-order traversal, then you just might be building yourself a worst-case tree.

Answer 2

While there's no reason why you can't do this, there is little point in doing it other than to prove just how futile an endeavour it would be. A binary tree is used to sort data logarithmically. But every node in a tree should be capable of sorting its own data. Passing sorted data to a binary tree would result in an unbalanced tree that is completely biased towards the right.

Think about it: the root of a tree is directly related to each of its child nodes. Each child node is incomplete by itself. As are their child nodes. And theirs. If we imagine the root node is "A" and the child nodes are "1", "2" and "3", and child "1" has child nodes "a", "b" and "c", the only way to identify each node is via its ancestors, beginning at the root. There are 7 nodes in all, so there are 7 unique identifiers here: "A", "A->1", "A->1->a", "A->1->b", "A->1->c", "A->2" and "A->3".

Passing these identifiers to a binary tree would result in a root node containing "A", pointing to a right node containing "A->1", pointing to a right node containing "A->1->a", and so on. There would never be a left node, so you might as well create a singly-linked list instead. Even if the child nodes were unsorted, you'd still end up with a binary tree with "A" at the root and everything else to its right. And because of the inherent relationship between parents and children, there will always be a bias towards the right. This then forces you to "balance" the tree so there are equal numbers of nodes either side of the root, and equal depths.

If you want to sort a tree, then sort the tree itself. The tree structure has already done most of the work for you by creating relationships between each node and its parent, you've simply got to sort the child nodes within each parent. An internal quick-sort will get the job done far quicker than creating a completely separate structure that has no practical uses without major modification.

Answer 3

The algorithm to convert a forest tree into a binary tree in data structure can be quite long. You will need to start out with [head] and end with [finish].

Answer 4

hahaha on your face *****