From 6043a44ffbbbdd185e54177fd3a4f80fd46a0be0 Mon Sep 17 00:00:00 2001
From: Prince Gangurde <50592495+Prince326@users.noreply.github.com>
Date: Tue, 7 Apr 2020 04:29:32 +0530
Subject: [PATCH] Update basic_binary_tree.py (#1833)

fixed some grammar mistakes
---
 data_structures/binary_tree/basic_binary_tree.py | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/data_structures/binary_tree/basic_binary_tree.py b/data_structures/binary_tree/basic_binary_tree.py
index 4257a8e3c..3ed34fc6c 100644
--- a/data_structures/binary_tree/basic_binary_tree.py
+++ b/data_structures/binary_tree/basic_binary_tree.py
@@ -1,4 +1,4 @@
-class Node:  # This is the Class Node with constructor that contains data variable to type data and left,right pointers.
+class Node:  # This is the Class Node with a constructor that contains data variable to type data and left, right pointers.
     def __init__(self, data):
         self.data = data
         self.left = None
@@ -37,7 +37,7 @@ def depth_of_tree(
 
 def is_full_binary_tree(
     tree,
-):  # This functions returns that is it full binary tree or not?
+):  # This function returns that is it full binary tree or not?
     if tree is None:
         return True
     if (tree.left is None) and (tree.right is None):
@@ -48,7 +48,7 @@ def is_full_binary_tree(
         return False
 
 
-def main():  # Main func for testing.
+def main():  # Main function for testing.
     tree = Node(1)
     tree.left = Node(2)
     tree.right = Node(3)