Thread: Insert elements in binary tree

Originally Posted by lastrial

Okay...it looks like a Binary search tree insertr. I wasn't sure if binary tree follows the same procedure. Thanks!

A binary tree just means that internal nodes never have more than two children. But a tree isn't much use unless it has SOME kind of ordering to it. You're right to make the distinction, because there is more than one possible useful order.

A binary search tree is one order, which MacGyver described. A heap is another possible order. And there are things like binary Huffman trees where the order is actually a clever way of encoding information.

So to answer your general question, you insert data in a binary tree by deciding where to insert it and then inserting it there To get a more specific answer you have to ask a more specific question.