Hello.
im quite new to Trees. i have been practicing with Binary Search Trees. Well, here the way of building a tree is just comparing a value with the current node and deciding where the new value is put.
i mean:
say 3 4 1:
3 goes first
then 4 goes to the right of 3(4 > 3)
then 1 goes to the left of 3(1 < 3)
Are there any other ways of building trees? i saw an example in building a tree for an arithmetic expression.
Can anyone please give me some more examples or links as to how binary trees can be built(not Binary Search trees)?
Thanks in advance.