Given a binary tree, find its height. The height of a tree is defined as the number of edges on the longest path from the root to a leaf node. A leaf node is a node that does not have any children.

Homework 3: Binary Search Tree You are to code a binary search tree, BST, which is a collection of nodes, each having a data item and a reference pointing to a left and a right child nodes. The BST ...