Skip to content

Add insert and count-nodes #82

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
OmkarPathak merged 1 commit into from
Mar 2, 2018
Merged

Add insert and count-nodes #82

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
46 changes: 46 additions & 0 deletions pygorithm/data_structures/tree.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -72,6 +72,16 @@ def __init__(self):
self._pre_order = []
self._post_order = []

def insert(self, data):
"""
insert data to root or create a root node
"""
if self.root:
self.root.set_data(data)
else:
self.root = Node()
self.root.set_data(data)

def inorder(self, root):
"""
in this we traverse first to the leftmost node,
Expand Down Expand Up @@ -117,6 +127,24 @@ def postorder(self, root):
self._post_order.append(root.get_data())
return self._post_order

def number_of_nodes(self, root):
"""
counting number of nodes
"""
# need testing
left_number = 0;
right_number = 0;

#number of nodes left side
if root.get_left():
left_number = self.number_of_nodes(root.get_left())

#numbeof nodes right side
if root.get_right():
right_number = self.number_of_nodes(root.get_right())

return left_number + right_number + 1

@staticmethod
def get_code():
"""
Expand Down Expand Up @@ -359,6 +387,24 @@ def postorder(self):
if self.root is not None:
return self.root.postorder(self.root)

def number_of_nodes(self, root):
"""
counting number of nodes
"""
# need testing
left_number = 0;
right_number = 0;

#number of nodes left side
if root.get_left():
left_number = self.number_of_nodes(root.get_left())

#numbeof nodes right side
if root.get_right():
right_number = self.number_of_nodes(root.get_right())

return left_number + right_number + 1

@staticmethod
def get_code():
"""
Expand Down