Question

Where the highest node must be placed in a binary tree?

Answer 1

We extend the concept of linked data structures to structure containing nodes with more than one self-referenced field. A binary tree is made of nodes, where each node contains a "left" reference, a "right" reference, and a data element. The topmost node in the tree is called the root.
Every node (excluding a root) in a tree is connected by a directed edge from exactly one other node. This node is called a parent. On the other hand, each node can be connected to arbitrary number of nodes, called children. 


i hope help you

Answer 2

Answer:

The maximum number of nodes at level 'l' of a binary tree is 2l. Here level is the number of nodes on the path from the root to the node (including root and node).