You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This is a simple program to check if a binary tree is full or not.
4
+
5
+
# Tree
6
+
7
+
A tree is a data structure in which each node has at most two children. The topmost node is called the root node. The nodes that do not have any children are called leaf nodes.
8
+
9
+
## Binary Tree
10
+
11
+
A binary tree is a tree in which each node has at most two children. The two children of a node are called the left child and the right child.
12
+
13
+
## Full Binary Tree
14
+
15
+
A full binary tree is defined as a binary tree in which all nodes have either zero or two child nodes. Conversely, there is no node in a full binary tree, which has one child node.
0 commit comments