Write in pseudo code or code to traverse the tree and verify if it is balanced and/or binary. First consider how you will represent the edges and nodes as data in your program and used this in your code.

Pseudo Code :

• Pseudocode, as used in computer science, is a simple explanation of how an algorithm or other system works.
• Although pseudocode frequently adopts standard programming language structure rules, it is written for human rather than machine analysis.
• Typically, it excludes information like variable definitions and language-specific code that is necessary for an algorithm to be understood by a computer.
• The use of pseudocode serves the dual purpose of being a more effective and environment-independent representation of an algorithm's fundamental concepts than standard programming language code.

Balanced Tree :

• It is a tree that only has a one-height difference between the left and right subtrees of any given node.
• It is computationally efficient to perform operations on balanced binary trees.
• The following circumstances will be met by a balanced binary tree:
• At any node, the difference between the heights of the left and right subtrees is smaller than 1.
• Each node has a balanced binary tree as its left subtree.
• The right subtree of each node is a balanced binary tree.

Binary Tree :

• A binary tree is a non-linear data structure in the form of a tree that can have up to two children for each parent.
• In addition to the data element, each node in a binary tree also carries left and right references.
• The root node of a tree is the node at the top of its hierarchy.

Basic Operation that can be performed on Binary Tree: