If the middle element is greater than the target, the left half of the array is searched next.

If the target is less than the mid value, the search should continue in the left half of the array.

Typically, binary search returns -1 to indicate that the target value is not present in the array.

Typically, binary search returns -1 to indicate that the target value is not found in the array.

A binary tree node can have at most two children, typically referred to as the left child and the right child.

In a binary tree, the number of edges is always one less than the number of nodes, hence there are n-1 edges for n nodes.

In a binary tree, the maximum number of leaf nodes is n + 1, where n is the number of internal nodes.

The maximum number of nodes at level 'h' in a binary tree is 2^h, as each node can have two children.

All traversal methods (in-order, pre-order, post-order) will visit all nodes even if a node has only one child.

If a node has two children, it can lead to a maximum of 3 leaf nodes in its subtree, assuming each child has at least one leaf.

If a node has two children, there are at least 3 nodes in its subtree (the node itself and its two children).

If a node has two children, there are 3 nodes in the subtree rooted at that node (the node itself and its two children).

If a node has two children, it can lead to a maximum of 4 nodes at the next level (2 children for each of the 2 children).

To reconstruct a binary tree, both in-order and post-order traversals are needed.

The pre-order traversal can be derived from the in-order traversal and the structure of the tree, yielding [A, B, D, E, C, F].

Level-order traversal uses a queue to keep track of nodes at each level as it processes them.

A null left child indicates that the node is a leaf node, meaning it has no children.

A node with both left and right children is referred to as a full node in the context of binary trees.

A node with two children is referred to as a full node, as it has both left and right children.

The height of a binary tree is defined as the maximum depth of any node, which is the longest path from the root to a leaf.

A leaf node is defined as a node that has no children.

The height of a tree with only one node is 0, as height is defined as the number of edges on the longest path from the root to a leaf.

In in-order traversal, the nodes are visited in the order: left subtree, root, right subtree.

In-order traversal visits the left subtree, then the root, and then the right subtree. For a tree with nodes 1, 2, 3, the in-order traversal is [2, 1, 3].

The in-order traversal visits the left subtree, then the root, and then the right subtree, resulting in B, A, C, D.

In in-order traversal, the left subtree is visited first, then the root, and finally the right subtree. For a tree with nodes A (root), B (left), and C (right), the traversal is B, A, C.

The in-order traversal visits the left child first, then the root, and finally the right child, resulting in 2, 1, 3.

The maximum height of a binary tree with n nodes occurs when the tree is skewed, resulting in a height of n-1.

In a binary tree, each node can have at most two children, typically referred to as the left and right child.

The maximum number of leaf nodes in a binary tree of height h is 2^h, as each level can have twice the number of nodes as the previous level.