Help me in a trees please

Answer 1

A node of tree has at most two child is called binary tree.

Answer 2

I mean node, sorry I have not written. Thanks

Answer 3

what is bin trees

Answer 4

Here are the core concept of a binary search tree:

Binary Tree - A directed, rooted tree where:

1) Each node has a key value that can be compared to other key values.

2) Each node has two subtrees called the left and right subtree, either of which could be empty.

3) A node with both empty subtrees is called a leaf.

4) Any key values in nodes in the left subtree of a node must be <= key value of that node.

5) Same as 4 except >= in right subtree.

For more detailed information, check out this link:

https://www.cs.cmu.edu/~adamchik/15-121/lectures/Trees/trees.html

Answer 5

@Aditya kumar pandey, you have a bit of a misconception. A binary tree can have as many children as you want, but only two sub-tree's per node. The beginning of each subtree from a node is a child, so if you have 4 parent nodes each with two subtrees, you have at least 8 children. All parent nodes excluding the root node are children of another parent node.